default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th ICTAC 2008: Istanbul, Turkey
- John S. Fitzgerald, Anne E. Haxthausen, Hüsnü Yenigün:
Theoretical Aspects of Computing - ICTAC 2008, 5th International Colloquium, Istanbul, Turkey, September 1-3, 2008. Proceedings. Lecture Notes in Computer Science 5160, Springer 2008, ISBN 978-3-540-85761-7 - Jean-Raymond Abrial, Thai Son Hoang:
Using Design Patterns in Formal Methods: An Event-B Approach. 1-2 - Jan Peleska:
A Unified Approach to Abstract Interpretation, Formal Verification and Testing of C/C++ Modules. 3-22 - A. W. Roscoe:
The Three Platonic Models of Divergence-Strict CSP. 23-49 - Parosh Aziz Abdulla, Giorgio Delzanno, Ahmed Rezine:
Monotonic Abstraction in Action. 50-65 - Oana Agrigoroaiei, Gabriel Ciobanu
:
Non-interleaving Semantics with Causality for Nondeterministic Dataflow. 66-80 - Stefan Blom, Jaco van de Pol:
Symbolic Reachability for Process Algebras with Recursive Data Types. 81-95 - Haiming Chen, Lei Chen:
Inclusion Test Algorithms for One-Unambiguous Regular Expressions. 96-110 - Francien Dechesne, Simona Orzan, Yanjing Wang:
Refinement of Kripke Models for Dynamics. 111-125 - Carlo A. Furia, Paola Spoletini:
Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers. 126-140 - Will Harwood, Ana Cavalcanti, Jim Woodcock:
A Theory of Pointers for the UTP. 141-155 - Mohammad Izadi, Marcello M. Bonsangue:
Recasting Constraint Automata into Büchi Automata. 156-170 - Fairouz Kamareddine, Karim Nour, Vincent Rahli, J. B. Wells:
A Complete Realisability Semantics for Intersection Types and Arbitrary Expansion Variables. 171-185 - Hanna Klaudel, Maciej Koutny, Elisabeth Pelz, Franck Pommereau:
Towards Efficient Verification of Systems with Dynamic Process Creation. 186-200 - Jing Li, Huibiao Zhu, Jifeng He:
An Observational Model for Transactional Calculus of Services Orchestration. 201-215 - Mila E. Majster-Cederbaum, Christoph Minnameier:
Everything Is PSPACE-Complete in Interaction Systems. 216-227 - Yassine Mokhtari, Sa'ed Abed, Otmane Aït Mohamed, Sofiène Tahar, Xiaoyu Song:
A New Approach for the Construction of Multiway Decision Graphs. 228-242 - Masaki Murakami:
Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs. 243-257 - Sidney C. Nogueira, Augusto Sampaio, Alexandre Mota:
Guided Test Generation from CSP Models. 258-273 - Gordon J. Pace, Gerardo Schneider:
Relaxing Goodness Is Still Good. 274-289 - Matteo Pradella, Angelo Morzenti, Pierluigi San Pietro:
Benchmarking Model- and Satisfiability-Checking on Bi-infinite Time. 290-304 - Vahid Rafe, Adel Torkaman Rahmani:
Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems. 305-318 - Rudolf Schlatte, Bernhard K. Aichernig, Frank S. de Boer, Andreas Griesmayer, Einar Broch Johnsen:
Testing Concurrent Objects with Application-Specific Schedulers. 319-333 - Jens Schönborn, Marcel Kyas:
A Theory of Bounded Fair Scheduling. 334-348 - Simona Orzan, Muhammad Torabi Dashti:
Fair Exchange Is Incomparable to Consensus. 349-363 - Edward Turner, Helen Treharne, Steve A. Schneider, Neil Evans:
Automatic Generation of CSP || B Skeletons from xUML Models. 364-379 - Heike Wehrheim:
Bounded Model Checking for Partial Kripke Structures. 380-394 - Miaomiao Zhang, Dang Van Hung, Zhiming Liu:
Verification of Linear Duration Invariants by Model Checking CTL Properties. 395-409 - Areej Zuhily, Alan Burns:
Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks. 410-424 - Rachid Rebiha, Nadir Matringe, Arnaldo Vieira Moura:
Endomorphisms for Non-trivial Non-linear Loop Invariant Generation. 425-439 - Alexander van Dam, Bas Ploeger, Tim A. C. Willemse:
Instantiation for Parameterised Boolean Equation Systems. 440-454
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 2024-11-15 19:20 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:
