![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
13th ICTAC 2016: Taipei, Taiwan
- Augusto Sampaio, Farn Wang:
Theoretical Aspects of Computing - ICTAC 2016 - 13th International Colloquium, Taipei, Taiwan, ROC, October 24-31, 2016, Proceedings. Lecture Notes in Computer Science 9965, 2016, ISBN 978-3-319-46749-8
Invited Papers
- Oleg Travkin, Heike Wehrheim:
Verification of Concurrent Programs on Weak Memory Models. 3-24 - Hsu-Chun Yen:
Petri Nets and Semilinear Sets (Extended Abstract). 25-29
Program Verification
- Yi Li:
Termination of Single-Path Polynomial Loop Programs. 33-50 - Walter Guttmann:
Relation-Algebraic Verification of Prim's Minimum Spanning Tree Algorithm. 51-68 - Allyx Fontaine, Akka Zemmari
:
Certified Impossibility Results and Analyses in Coq of Some Randomised Distributed Algorithms. 69-81 - Anh-Hoang Truong, Ngoc-Khai Nguyen, Dang Van Hung, Duc-Hanh Dang
:
Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs. 82-99
Design, Synthesis and Testing
- Jetty Kleijn, Maciej Koutny, Marta Pietkiewicz-Koutny:
Synthesis of Petri Nets with Whole-Place Operations and Localities. 103-120 - Annabelle McIver
, Tahiry M. Rabehaja, Georg Struth:
Schedulers and Finishers: On Generating the Behaviours of an Event Structure. 121-138 - Thomas Given-Wilson
, Axel Legay:
On the Expressiveness of Symmetric Communication. 139-157 - Ana C. V. de Melo, Corina S. Pasareanu, Simone Hanazumi:
Towards MC/DC Coverage of Properties Specification Patterns. 158-175
Calculi
- Flávio L. C. de Moura
:
Unification for \lambda -calculi Without Propagation Rules. 179-195 - Pierre Halmagrand:
Soundly Proving B Method Formulæ Using Typed Sequent Calculus. 196-213 - Michell Guzmán, Salim Perchy, Camilo Rueda
, Frank D. Valencia:
Deriving Inverse Operators for Modal Logic. 214-232
Specifications
- Diego Marmsoler, Mario Gleirscher
:
Specifying Properties of Dynamic Architectures Using Configuration Traces. 235-254 - Ana Cavalcanti
, Jim Woodcock
, Nuno Amálio:
Behavioural Models for FMI Co-simulations. 255-273 - Martin Hilscher, Maike Schwammberger
:
An Abstract Model for Proving Safety of Autonomous Urban Traffic. 274-292
Composition and Transformation
- Simon Foster
, Frank Zeyda, Jim Woodcock
:
Unifying Heterogeneous State-Spaces with Lenses. 295-314 - Jon Haël Brenas, Rachid Echahed, Martin Strecker
:
Ensuring Correctness of Model Transformations While Remaining Decidable. 315-332 - Steven Obua, Phil Scott, Jacques D. Fleuriot
:
ProofScript: Proof Scripting for the Masses. 333-348
Automata
- Akim Demaille:
Derived-Term Automata for Extended Weighted Rational Expressions. 351-369 - Parvaneh Babari
, Manfred Droste, Vitaly Perevoshchikov:
Weighted Register Automata and Weighted Logic on Data Words. 370-384 - Renato Neves
, Luís Soares Barbosa
:
Hybrid Automata as Coalgebras. 385-402
Temporal Logics
- Peter Nazier Mosaad, Martin Fränzle
, Bai Xue:
Temporal Logic Verification for Delay Differential Equations. 405-421 - Alexandre Madeira
, Luís Soares Barbosa
, Rolf Hennicker, Manuel A. Martins
:
Dynamic Logic with Binders and Its Application to the Development of Reactive Systems. 422-440 - Mario R. F. Benevides
, Bruno Lopes
, Edward Hermann Haeusler:
Propositional Dynamic Logic for Petri Nets with Iteration. 441-456
Tool and Short Papers
- Raphaël Cauderlier, Catherine Dubois:
ML Pattern-Matching, Recursion, and Rewriting: From FoCaLiZe to Dedukti. 459-468 - Étienne André
:
Parametric Deadlock-Freeness Checking Timed Automata. 469-478
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.