Foundations of Computing group
| Title | Foundations of Computing group |
|---|
Latest research outputs
Sort by Date Title
The lattice structure of sets of surjective hyper-operations
Martin, B. 2010. The lattice structure of sets of surjective hyper-operations. The 16th International Conference on Principles and Practice of Constraint Programming (CP 2010). St Andrews, Scotland 06 - 10 Sep 2010 Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_31Conference paper
Some topological properties of paraconsistent models
Baskent, C. 2013. Some topological properties of paraconsistent models. Synthese. 190 (18), pp. 4023-4040. https://doi.org/10.1007/s11229-013-0246-8Article
Distance constraint satisfaction problems
Bodirsky, M., Dalmau, V., Martin, B. and Pinsker, M. 2010. Distance constraint satisfaction problems. 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010). Brno, Czech Republic 23 - 27 Aug 2010 Springer. pp. 162-173 https://doi.org/10.1007/978-3-642-15155-2_16Conference paper
The complexity of positive first-order logic without equality II: the four-element case
Martin, B. and Martin, J. 2010. The complexity of positive first-order logic without equality II: the four-element case. 24th International Workshop (CSL 2010), 19th Annual Conference of the EACSL. Brno, Czech Republic 23 - 27 Aug 2010 Springer. pp. 426-438 https://doi.org/10.1007/978-3-642-15205-4_33Conference paper
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 2010). Edinburgh 11 - 14 Jul 2010 Institute of Electrical and Electronics Engineers. pp. 90-99 https://doi.org/10.1109/LICS.2010.13Conference paper
The limits of tractability in resolution-based propositional proof systems
Dantchev, S. and Martin, B. 2010. The limits of tractability in resolution-based propositional proof systems. 6th International Conference on Computability in Europe: Programs, Proofs, Processes (CIE 2010). Portugal 30 Jun - 04 Jul 2010Conference paper
A tetrachotomy for positive first-order logic without equality
Madelaine, F. and Martin, B. 2011. A tetrachotomy for positive first-order logic without equality. 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011). Ontario, Canada 21 - 24 Jun 2011 IEEE. pp. 311-320 https://doi.org/10.1109/LICS.2011.27Conference paper
QCSP on partially reflexive forests
Martin, B. 2011. QCSP on partially reflexive forests. The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011). Perugia, Italy 12 - 16 Sep 2011 Springer. pp. 546-560 https://doi.org/10.1007/978-3-642-23786-7_42Conference paper
The computational complexity of disconnected cut and 2K2-partition
Martin, B. and Paulusma, D. 2011. The computational complexity of disconnected cut and 2K2-partition. The 17th International Conference on Principles and Practice of Constraint Programming (CP 2011). Perugia, Italy 12 - 16 Sep 2011 Springer. pp. 561-575 https://doi.org/10.1007/978-3-642-23786-7_43Conference paper
Quantified constraints and containment problems
Chen, H., Madelaine, F. and Martin, B. 2008. Quantified constraints and containment problems. 23rd Annual IEEE Symposium on Logic in Computer Science (LICS 2008). Pittsburgh, PA, USA 24 - 27 Jun 2008 IEEE. pp. 317-328 https://doi.org/10.1109/LICS.2008.15Conference paper
First-order model checking problems parameterized by the model
Martin, B. 2008. First-order model checking problems parameterized by the model. The 4th Conference on Computability in Europe: Logic and Theory of Algorithms (CiE 2008). University of Athens, Greece 15 - 20 Jun 2008 Springer. pp. 417-427 https://doi.org/10.1007/978-3-540-69407-6_45Conference paper
Encoding monomorphic and polymorphic types
Blanchette, J., Böhme, S., Popescu, A. and Smallbone, N. 2013. Encoding monomorphic and polymorphic types. 19th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS). Rome 16 - 24 Mar 2013 Springer. pp. 493-507Conference paper
Constraint satisfaction with counting quantifiers
Madelaine, F., Martin, B. and Stacho, J. 2012. Constraint satisfaction with counting quantifiers. The 7th International Computer Science Symposium (CSR 2012). Nizhny Novgorod, Russia 03 - 07 Jul 2012 Springer. pp. 253-265 https://doi.org/10.1007/978-3-642-30642-6_24Conference paper
Finding vertex-surjective graph homomorphisms
Golovach, P., Lidický, B., Martin, B. and Paulusma, D. 2012. Finding vertex-surjective graph homomorphisms. 7th International Computer Science Symposium (CSR 2012). Nizhny Novgorod, Russia 03 - 07 Jul 2012 Springer. pp. 160-171 https://doi.org/10.1007/978-3-642-30642-6_16Conference paper
The limits of tractability in resolution-based propositional proof systems
Dantchev, S. and Martin, B. 2011. The limits of tractability in resolution-based propositional proof systems. Annals of Pure and Applied Logic. 163 (6), pp. 656-668. https://doi.org/10.1016/j.apal.2011.11.001Article
Low-level dichotomy for quantified constraint satisfaction problems
Martin, B. 2011. Low-level dichotomy for quantified constraint satisfaction problems. Information Processing Letters. 111 (20), pp. 999-1003. https://doi.org/10.1016/j.ipl.2011.07.010Article
Cutting planes and the parameter cutwidth
Dantchev, S. and Martin, B. 2011. Cutting planes and the parameter cutwidth. Theory of Computing Systems. 51 (1), pp. 50-64. https://doi.org/10.1007/s00224-011-9373-0Article
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
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
Advances in new technologies, interactive interfaces and communicability
Cipolla Ficarra, F., Veltman, K., Verber, D., Cipolla-Ficarra, M. and Kammueller, F. (ed.) 2012. Advances in new technologies, interactive interfaces and communicability. Springer Verlag.Book
The complexity of surjective homomorphism problems - a survey
Bodirsky, M., Kara, J. and Martin, B. 2012. The complexity of surjective homomorphism problems - a survey. Discrete Applied Mathematics. 160 (12), pp. 1680-1690.Article
Sound tools for package dependency management in free and open source software distributions
Boender, J. 2007. Sound tools for package dependency management in free and open source software distributions. Feller, J., Fitzgerald, B., Scacchi, W. and Sillitti, A. (ed.) Berlin and Heidelberg, Germany Springer.Conference poster
Strong dependencies between software components
Abate, P., Di Cosmo, R., Boender, J. and Zacchiroli, S. 2009. Strong dependencies between software components. in: 2009 3rd International Symposium on Empirical Software Engineering and Measurement (ESEM 2009). IEEE. pp. 89 -99Book chapter
Efficient computation of dominance in component systems (short paper)
Boender, J. 2011. Efficient computation of dominance in component systems (short paper). in: Software engineering and formal methods: 9th International Conference, SEFM 2011, Montevideo, Uruguay, November 14-18, 2011. Proceedings Berlin and Heidelberg, Germany Springer.Book chapter
A semi-lattice model for multi-lateral security
Kammueller, F. 2013. A semi-lattice model for multi-lateral security. in: Data privacy management and autonomous spontaneous security Berlin, Germany Springer.Book chapter
A security model for functional active objects
Kammueller, F. 2012. A security model for functional active objects. Francisco, C., Kim, V., Miguel, C. and Andreas, K. (ed.) First International Symposium Communicability, Computer Graphics and Innovative Design for Interactive Systems (CCGIDIS 2011). Berlin Springer. https://doi.org/10.1007/978-3-642-33760-4_4Conference paper
On knowledge and obligation
Baskent, C., Olde Loohuis, L. and Parikh, R. 2012. On knowledge and obligation. Episteme. 9 (2), pp. 171-188. https://doi.org/10.1017/epi.2012.7Article
A security model for functional active objects with an implementation in Erlang
Fleck, A. and Kammueller, F. 2011. A security model for functional active objects with an implementation in Erlang. in: Ficarra, F., Kratky, A., Veltman, K., Ficarra, M., Nicol, E. and Brie, M. (ed.) Computational informatics, social factors and new information technologies: hypermedia perspectives and avant-garde experiences in the era of communicability expansion Bergamo, Italy Blue Herons.Book chapter
Engineering security protocols with modelchecking – Radius-SHA256 and secured simple protocol.
Kammueller, F., Mapp, G., Patel, S. and Sani, A. 2012. Engineering security protocols with modelchecking – Radius-SHA256 and secured simple protocol. International Conference on Internet Monitoring and Protection (ICIMP 2012). Stuttgart, Germany 27 May - 01 Jun 2012 Xpert Publishing Service.Conference paper
Review for the American Mathematical Society (AMS): A. Francalanza et al. Permission-based separation logic for message-passing concurrency. Logical methods in computer science, 7: 1-47, 2011
Kammueller, F. 2012. Review for the American Mathematical Society (AMS): A. Francalanza et al. Permission-based separation logic for message-passing concurrency. Logical methods in computer science, 7: 1-47, 2011. Mathematical Reviews.Article
Reviews for the American Mathematical Society (AMS): Russell O’Connor. Classical mathematics for a constructive world. MSCS (21): 861–882, Cambridge University Press. 2010.
Kammueller, F. 2012. Reviews for the American Mathematical Society (AMS): Russell O’Connor. Classical mathematics for a constructive world. MSCS (21): 861–882, Cambridge University Press. 2010. Mathematical Reviews.Article
A locally nameless theory of objects
Henrio, L., Kammueller, F., Lutz, B. and Sudhof, H. 2010. A locally nameless theory of objects. SAFA Annual Workshop on Formal Techniques (SAFA’2010). 2229 Route des Crêtes, 06560, Valbonne, Provence-Alpes-Côte d'Azur, FranceConference paper
Locally nameless sigma calculus
Henrio, L., Kammueller, F., Lutz, B. and Sudhof, H. 2010. Locally nameless sigma calculus. Archive of Formal Proof.Article
Formalizing statecharts using hierarchical automata
Helke, S. and Kammueller, F. 2010. Formalizing statecharts using hierarchical automata. Archive of Formal Proof.Article
Radius-SHA256 – verified remote authentication with secure hashing.
Kammueller, F. and Patel, S. 2011. Radius-SHA256 – verified remote authentication with secure hashing. First Global Conference on Communication, Science and Information Engineering, CCSIE’11. Middlesex University 25 - 27 Jul 2011Conference paper
ASPfun: a typed functional active object calculus
Henrio, L., Kammueller, F. and Lutz, B. 2012. ASPfun: a typed functional active object calculus. Science of Computer Programming. 77 (7-8), pp. 823-847. https://doi.org/10.1016/j.scico.2010.12.008Article
Application of verification techniques to security: model checking insider attacks
Kammueller, F., Probst, C. and Raimondi, F. 2012. Application of verification techniques to security: model checking insider attacks. 1st International Conference on Software and Emerging Technologies for Education, Culture, Entertainment, and Commerce (SETECEC 2012): New Directions in Multimedia Mobile Computing, Social Networks, Human-Computer Interaction and Communicability. Venice, Italy 28 - 29 Mar 2012 Blue Herons editions.Conference paper
Public announcement logic in geometric frameworks
Baskent, C. 2012. Public announcement logic in geometric frameworks. Fundamenta Informaticae. 118 (3), pp. 207-223. https://doi.org/10.3233/FI-2012-710Article
The complexity of positive first-order logic without equality
Madelaine, F. and Martin, B. 2012. The complexity of positive first-order logic without equality. ACM Transactions on Computational Logic. 13 (1), pp. 1-17. https://doi.org/10.1145/2071368.2071373Article
Modelchecking non-functional requirements for interface specifications.
Kammueller, F. and Preibusch, S. 2008. Modelchecking non-functional requirements for interface specifications. European Joint Conference on Theory and Practice of Software, 2008, (Foundations of Interface technologies). Budapest 29 Mar - 06 Apr 2008Conference paper
0
total views0
total downloads0
views this month0
downloads this month