Foundations of Computing group
| Title | Foundations of Computing group |
|---|
Latest research outputs
Sort by Date Title
Composing safely: a type system for aspects
Kammueller, F. and Sudhof, H. 2008. Composing safely: a type system for aspects. Lecture Notes in Computer Science. 4954, pp. 231-247. https://doi.org/10.1007/978-3-540-78789-1_18Article
Security analysis of private data enquiries in Erlang
Kammueller, F. and Kammueller, R. 2009. Security analysis of private data enquiries in Erlang. International Journal on Advances in Security. 2 (2&3), pp. 242-255.Article
An asynchronous distributed component model and its semantics
Henrio, L., Kammueller, F. and Rivera, M. 2009. An asynchronous distributed component model and its semantics. Lecture Notes in Computer Science. 5751, pp. 159-179. https://doi.org/10.1007/978-3-642-04167-9_9Article
A framework for reasoning on component composition
Henrio, L., Kammueller, F. and Khan, M. 2010. A framework for reasoning on component composition. Lecture Notes in Computer Science. 6286, pp. 1-20. https://doi.org/10.1007/978-3-642-17071-3_1Article
Formalizing non-interference for a simple bytecode language in Coq
Kammueller, F. 2008. Formalizing non-interference for a simple bytecode language in Coq. Formal Aspects of Computing. 20 (3), pp. 259-275.Article
Mechanical analysis of finite idempotent relations
Kammueller, F. 2011. Mechanical analysis of finite idempotent relations. Fundamenta Informaticae. 107 (1), pp. 43-65. https://doi.org/10.3233/FI-2011-392Article
Privacy enforcement and analysis for functional active objects
Kammueller, F. 2011. Privacy enforcement and analysis for functional active objects. Lecture Notes in Computer Science. 6514, pp. 93-107. https://doi.org/10.1007/978-3-642-19348-4_8Article
On the axiomatizability of priority II
Aceto, L., Chen, T., Ingolfsdottir, A., Luttik, B. and Van de Pol, J. 2011. On the axiomatizability of priority II. Theoretical Computer Science. 412 (28), pp. 3035-3044. https://doi.org/10.1016/j.tcs.2011.02.033Article
Parameterized proof complexity
Dantchev, S., Martin, B. and Szeider, S. 2011. Parameterized proof complexity. Computational Complexity. 20 (1), pp. 51-85. https://doi.org/10.1007/s00037-010-0001-1Article
PDVer, a tool to verify PDDL planning domains.
Raimondi, F., Pecheur, C. and Brat, G. 2009. PDVer, a tool to verify PDDL planning domains. ICAPS'09 Workshop on Verification and Validation of Planning and Scheduling Systems. Thessaloniki, Greece 20 Sep 2009Conference paper
The Anonymous subgraph problem.
Bettinelli, A., Liberti, L., Raimondi, F. and Savourey, D. 2009. The Anonymous subgraph problem. Cologne Twente Workshop 2009: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Paris 02 - 04 Jun 2009 pp. 269-274Conference paper
Combinatorial optimization based recommender systems.
Roda, F., Liberti, L. and Raimondi, F. 2009. Combinatorial optimization based recommender systems. Cologne Twente Workshop 2009: 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. Paris 02 - 04 Jun 2009 pp. 175-179Conference paper
Strong normalization for System F by HOAS on top of FOAS
Popescu, A., Gunter, E. and Osborn, C. 2010. Strong normalization for System F by HOAS on top of FOAS. 25th Annual IEEE Symposium on Logic in Computer Science (LICS). Edinburgh, United Kingdom 11 - 14 Jul 2010 IEEE. pp. 31-40Conference paper
Using strong conflicts to detect quality issues in component-based complex systems
Di Cosmo, R. and Boender, J. 2010. Using strong conflicts to detect quality issues in component-based complex systems. 3rd India Software Engineering Conference. Mysore, India 25 - 27 Feb 2010 New York Association for Computing Machinery (ACM). pp. 163-172Conference item
Context-aware adaptive applications: fault patterns and their automated identification
Sama, M., Elbaum, S., Raimondi, F., Rosenblum, D. and Wang, Z. 2010. Context-aware adaptive applications: fault patterns and their automated identification. IEEE Transactions on Software Engineering. 36 (5), pp. 644-661. https://doi.org/10.1109/TSE.2010.35Article
On the scope of the universal-algebraic approach to constraint satisfaction
Bodirsky, M., Hils, M. and Martin, B. 2010. On the scope of the universal-algebraic approach to constraint satisfaction. 25th Annual IEEE Symposium on Logic in Computer Science (LICS). Edinburgh, United Kingdom 11 - 14 Jul 2010 IEEE. pp. 90-99 https://doi.org/10.1109/LICS.2010.13Conference paper
Privacy by flexible parameterization with Erlang active objects.
Fleck, A. and Kammueller, F. 2010. Privacy by flexible parameterization with Erlang active objects. International Journal on Advances in Software. 3 (3-4), pp. 461-473.Article
Service-level agreements for electronic services
Skene, J., Raimondi, F. and Emmerich, W. 2010. Service-level agreements for electronic services. IEEE Transactions on Software Engineering. 36 (2), pp. 288-304. https://doi.org/10.1109/TSE.2009.55Article
A semantic approach to interpolation
Popescu, A., Şerbănuţă, T. and Roşu, G. 2009. A semantic approach to interpolation. Theoretical Computer Science. 410 (12-13), pp. 1109-1128. https://doi.org/10.1016/j.tcs.2008.09.038Article
Tight rank lower bounds for the Sherali–Adams proof system
Dantchev, S., Martin, B. and Rhodes, M. 2009. Tight rank lower bounds for the Sherali–Adams proof system. Theoretical Computer Science. 410 (21-23), pp. 2054-2063. https://doi.org/10.1016/j.tcs.2009.01.002Article
A model to design and verify context-aware adaptive service composition.
Cubo, J., Sama, M., Raimondi, F. and Rosenblum, D. 2009. A model to design and verify context-aware adaptive service composition. 6th IEEE International Conference on Services Computing (SCC 2009). Bangalore 21 - 25 Sep 2009Conference paper
A formal analysis of requirements-based testing
Pecheur, C., Raimondi, F. and Brat, G. 2009. A formal analysis of requirements-based testing. Rothermel, G. and Dillon, L. (ed.) ISSTA '09: International Symposium on Software Testing and Analysis. Chicago IL, USA 19 - 23 Jul 2009 Association for Computing Machinery (ACM). pp. 47-56 https://doi.org/10.1145/1572272.1572279Conference paper
MCMAS: a model checker for the verification of multi-agent systems
Lomuscio, A., Qu, H. and Raimondi, F. 2009. MCMAS: a model checker for the verification of multi-agent systems. Bouajjani, A. and Maler, O. (ed.) 21st International Conference on Computer Aided Verification (CAV 2009). Grenoble, France 26 Jun - 02 Jul 2009 Springer. pp. 682-688 https://doi.org/10.1007/978-3-642-02658-4_55Conference paper
Variables as resource in Hoare logic.
Bornat, R., Calcagno, C. and Parkinson, M. 2006. Variables as resource in Hoare logic. in: 21st Annual IEEE Symposium on Logic in Computer Science (LICS 2006), Seattle, Washington. Proceedings. IEEE Computer Society. pp. 137-146Book chapter
On finite alphabets and infinite bases
Chen, T., Fokkink, W., Luttik, B. and Nain, S. 2008. On finite alphabets and infinite bases. Information and Computation. 206 (5), pp. 492-519. https://doi.org/10.1016/j.ic.2007.09.003Article
Cyclic proofs of program termination in separation logic
Brotherston, J., Bornat, R. and Calcagno, C. 2008. Cyclic proofs of program termination in separation logic. ACM SIGPLAN Notices. 43 (1), pp. 101-112. https://doi.org/10.1145/1328897.1328453Article
The secret santa problem.
Liberti, L. and Raimondi, F. 2008. The secret santa problem. Lecture Notes in Computer Science. 5034, pp. 271-279. https://doi.org/10.1007/978-3-540-68880-8_26Article
Efficient online monitoring of web-service SLAs
Raimondi, F., Skene, J. and Emmerich, W. 2008. Efficient online monitoring of web-service SLAs. in: Harrold, J. and Murphy, G. (ed.) Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of Software Engineering Association for Computing Machinery (ACM). pp. 170-180Book chapter
Algorithms for efficient symbolic detection of faults in context-aware applications
Sama, M., Raimondi, F., Rosenblum, D. and Emmerich, W. 2008. Algorithms for efficient symbolic detection of faults in context-aware applications. 2008 23rd IEEE/ACM International Conference on Automated Software Engineering - Workshops. L'Aquila, Italy 15 - 16 Sep 2008 IEEE. pp. 1-8 https://doi.org/10.1109/ASEW.2008.4686287Conference paper
Modular verification of a non-blocking stack.
Bornat, R., Parkinson, M. and O'Hearn, P. 2007. Modular verification of a non-blocking stack. 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '07), Nice, France. Proceedings.. https://doi.org/10.1145/1190216.1190261Article
Variables as resources in separation logic
Bornat, R., Calcagno, C. and Yang, H. 2006. Variables as resources in separation logic. Electronic Notes in Theoretical Computer Science. 155, pp. 247-276. https://doi.org/10.1016/j.entcs.2005.11.059Article
Permission accounting in separation logic.
Bornat, R., Calcagno, C., Parkinson, M. and O'Hearn, P. 2005. Permission accounting in separation logic. 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05), Long Beach, California, USA. Proceedings. https://doi.org/10.1145/1047659.1040327Article
0
total views0
total downloads0
views this month0
downloads this month