ICTAC 2008
5th International Colloquium on
Theoretical Aspects of Computing
| (1) Heike Wehrheim. Bounded Model Checking for Partial Kripke Structures |
| (2) Jing Li, Huibiao Zhu and Jifeng He. An Observational Model for Transactional Calculus of Services Orchestration |
| (3) Andres Montoya. A parameterized Polynomial Hierarchy |
| (4) Y. Mokhtari, Sa'ed Abed, Otmane Ait Mohamed, Sofiene Tahar and xiaoyu song. A New Approach for the Construction of Multiway Decision Graphs |
| (5) Masaki Murakami. Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs |
| (6) Alexander van Dam, Bas Ploeger and Tim Willemse. Instantiation for Parameterised Boolean Equation Systems |
| (7) Gordon J. Pace and Gerardo Schneider. Relaxing Goodness is Still Good |
| (8) Mohammad Izadi and Marcello Bonsangue. Recasting Constraint Automata into Buchi Automata |
| (9) Christoph Minnameier and Mila Majster-Cederbaum. Everything is PSPACE-Complete in Interaction Systems |
| (10) Matteo Pradella, Angelo Morzenti and Pierluigi San Pietro. Benchmarking Model- and Satisfiability-Checking on bi-infinite time |
| (11) Oana Agrigoroaiei and Gabriel Ciobanu. Non-Interleaving Semantics with Causality for Nondeterministic Dataflow |
| (12) Stefan Blom and Jaco van de Pol. Symbolic Reachability for Process Algebras with Recursive Data Types |
| (13) Fairouz Kamareddine, Karim Nour, Vincent Rahli and Joe Wells. A complete realisability semantics for intersection types and infinite expansion variables |
| (14) Vahid Rafe and Adel T. Rahmani. Formal Modeling of Workflows Using UML 2.0 Activities: A Graph Transformation-Based Approach |
| (15) Will Harwood, Ana Cavalcanti and Jim Woodcock. A Theory of Pointers for the UTP |
| (16) Jens Schoenborn and Marcel Kyas. A Theory of Bounded Fair Scheduling |
| (17) Carlo Alberto Furia and Paola Spoletini. Tomorrow and All Our Yesterdays: MTL Satisfiability over the Integers |
| (18) Rudolf Schlatte, Bernhard K. Aichernig, Frank S. de Boer, Andreas Griesmayer and Einar Broch Johnsen. Testing Concurrent Objects with Application-Specific Schedulers |
| (19) Haiming Chen and Lei Chen. Inclusion Test Algorithms for One-Unambiguous Regular Expressions |
| (20) Hanna Klaudel, Maciej Koutny, Elisabeth Pelz and Franck Pommereau. Towards Efficient Verification of Systems with Dynamic Process Creation |
| (21) Areej Zuhily and Alan Burns. Exact Response Time Scheduling Analysis of Accumulatively Monotonic Multiframe Real Time Tasks |
| (22) Sidney Nogueira, Augusto Sampaio and Alexandre Mota. Guided Test Generation from CSP Models |
| (23) rachid rebiha, Nadir Matringe and Arnaldo Vieira Moura. Endomorphism for Non-Trivial Non-Linear Invariant Generation. |
| (24) Miaomiao Zhang, Dang Van Hung and Zhiming Liu. Verification of Linear Duration Invariants by Model Checking CTL Properties |
| (25) Mohammad Torabi Dashti and Simona Orzan. Fair exchange is incomparable to consensus |
| (26) Parosh Abdulla, Giorgio Delzanno and Ahmed Rezine. Monotonic Abstraction in Action (Automatic Verification of Distributed Mutex Algorithms) |
| (27) Edward Turner, Helen Treharne, Steve Schneider and Neil Evans. Automatic generation of CSP || B skeletons from xUML models |
| (28) Francien Dechesne, Simona Orzan and Yanjing Wang. Refinement of Kripke Models for Dynamics |