default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd ICTAC 2006: Tunis, Tunisia
- Kamel Barkaoui, Ana Cavalcanti, Antonio Cerone:
Theoretical Aspects of Computing - ICTAC 2006, Third International Colloquium, Tunis, Tunisia, November 20-24, 2006, Proceedings. Lecture Notes in Computer Science 4281, Springer 2006, ISBN 3-540-48815-4
Invited Papers
- Tobias Nipkow:
Verifying a Hotel Key Card System. 1-14 - Jim Woodcock
, Leo Freitas:
Z/Eves and the Mondex Electronic Purse. 15-34 - Aaron R. Bradley, Zohar Manna:
Verification Constraint Problems with Strengthening. 35-49
Semantics
- Annabelle McIver:
Quantitative µ-Calculus Analysis of Power Management in Wireless Networks. 50-64 - Mila E. Majster-Cederbaum, Christoph Minnameier:
Termination and Divergence Are Undecidable Under a Maximum Progress Multi-step Semantics for LinCa. 65-79 - Gabriel Ciobanu, Danut Rusu:
A Topological Approach of the Web Classification. 80-92
Concurrency
- Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, Angelo Troina:
Bisimulation Congruences in the Calculus of Looping Sequences. 93-107 - Marcos E. Kurbán, Peter Niebert, Hongyang Qu, Walter Vogler:
Stronger Reduction Criteria for Local First Search. 108-122 - Malcolm Tyrrell, Joseph M. Morris, Andrew Butterfield, Arthur Hughes:
A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes. 123-137 - Raymond Devillers, Hanna Klaudel, Maciej Koutny:
A Petri Net Translation of pi-Calculus Terms. 138-152
Model Checking
- Yohan Boichut, Pierre-Cyrille Héam, Olga Kouchnarenko:
Handling Algebraic Properties in Automatic Analysis of Security Protocols. 153-167 - Gordon J. Pace, Gerardo Schneider:
A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems. 168-182 - Alexander Malkis, Andreas Podelski, Andrey Rybalchenko:
Thread-Modular Verification Is Cartesian Abstract Interpretation. 183-197
Formal Languages
- Murdoch Gabbay, Aad Mathijssen:
Capture-Avoiding Substitution as a Nominal Algebra. 198-212 - Kieu Van Hung, Do Long Van:
Prime Decomposition Problem for Several Kinds of Regular Codes. 213-227 - Jan Supol, Borivoj Melichar:
A New Approach to Determinisation Using Bit-Parallelism. 228-241
Logic and Type Theory
- Matteo Slanina, Henny B. Sipma, Zohar Manna:
Proving ATL* Properties of Infinite-State Systems. 242-256 - Shuling Wang, Quan Long, Zongyan Qiu:
Type Safety for FJ and FGJ. 257-271 - Steven Obua:
Partizan Games in Isabelle/HOLZF. 272-286 - Amine Chaieb:
Proof-Producing Program Analysis. 287-301
Real-Time and Mobility
- Giorgio Delzanno, Roberto Montagna:
Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting. 302-316 - Moez Krichen, Stavros Tripakis:
Interesting Properties of the Real-Time Conformance Relation. 317-331 - Roland Meyer, Johannes Faber, Andrey Rybalchenko:
Model Checking Duration Calculus: A Practical Approach. 332-346 - Jan-David Quesel, Andreas Schäfer:
Spatio-temporal Model Checking for Mobile Real-Time Systems. 347-361
Tutorials: Extended Abstracts
- Christine Choppy, Serge Haddad, Hanna Klaudel, Fabrice Kordon, Laure Petrucci, Yann Thierry-Mieg:
Tutorial on Formal Methods for Distributed and Cooperative Systems. 362-365 - David Déharbe, Pascal Fontaine, Silvio Ranise, Christophe Ringeissen:
Decision Procedures for the Formal Analysis of Software. 366-370
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-17 22:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
