Publications du groupe «Vérification et Méthodes Formelles»
|
|
- Francis Parker
- 6 years ago
- Views:
Transcription
1 Publications du groupe «Vérification et Méthodes Formelles» Département d Informatique, Faculté des Sciences, ULB, CPI 212 Années Références [1] Pierluigi Ammirati, Giorgio Delzanno, Pierre Ganty, Gilles Geeraerts, Jean- François Raskin, and Laurent Van Begin. Babylon : An integrated tool for the specification and verification of parametrized systems. In Proceedings of SAVE, 2nd workshop on Specification, Analysis and Validation for Emerging technologies, Copenhagen, Denmark, [2] Parosh Aziz Abdulla, Giorgio Delzanno, and Laurent Van Begin. Comparing the expressive power of well-structured transition systems. In CSL, pages , [3] Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Quantitative model-checking of one-clock timed automata under probabilistic semantics. In QEST, pages 55 64, [4] Bernard Boigelot and Julien Brusten. A generalization of cobham s theorem to automata over real numbers. In ICALP, pages , [5] Patricia Bouyer, Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On the optimal reachability problem. In Formal Methods in System Design, [6] Patricia Bouyer, Thomas Brihaye, and Nicolas Markey. Improved undecidability results on weighted timed automata. Inf. Process. Lett., 98(5) : , [7] Patricia Bouyer, Serge Haddad, and Pierre-Alain Reynier. Timed petri nets and timed automata : On the discriminating power of zeno sequences. Inf. Comput., 206(1) :73 107, [8] Patricia Bouyer, Nicolas Markey, and Pierre-Alain Reynier. Robust analysis of timed automata via channel machines. In FoSSaCS, pages , [9] Thomas Brihaye, Véronique Bruyère, Laurent Doyen, Marc Ducobu, and Jean- François Raskin. Antichain-based qbf solving, [10] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. Model-checking for weighted timed automata. In FORMATS/FTRTFT, pages , [11] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On optimal timed strategies. In FORMATS, pages 49 64,
2 [12] Thomas Brihaye, Véronique Bruyère, and Jean-François Raskin. On modelchecking timed automata with stopwatch observers. Inf. Comput., 204(3) : , [13] Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Prabhu, and Jean-François Raskin. Minimum-time reachability in timed games. In ICALP, pages , [14] Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, and Nicolas Markey. Atl with strategy contexts and bounded memory. In LFCS, pages , [15] Thomas Brihaye, Nicolas Markey, Mohamed Ghannem, and Lionel Rieg. Good friends are hard to find! In TIME, pages 32 40, [16] Véronique Bruyère, Emmanuel Dall olio, and Jean-François Raskin. Durations and parametric model-checking in timed automata. ACM Trans. Comput. Logic, 9 :12 :1 12 :23, April [17] Véronique Bruyère and Jean-François Raskin. Real-time model-checking : Parameters everywhere. In Paritosh K. Pandya and Jaikumar Radhakrishnan, editors, FST TCS 2003 : Foundations of Software Technology and Theoretical Computer Science, volume 2914 of Lecture Notes in Computer Science, pages Springer Berlin / Heidelberg, Springer Berlin / Heidelberg, [18] Véronique Bruyère and Jean-François Raskin. Real-time model-checking : Parameters everywhere. Logical Methods in Computer Science, 3(1), [19] Franck Cassez, Alexandre David, Kim Guldstrand Larsen, Didier Lime, and Jean- François Raskin. Timed control with observation based and stuttering invariant strategies. In ATVA, pages , [20] Franck Cassez, Thomas A. Henzinger, and Jean-François Raskin. A comparison of control problems for timed and hybrid systems. In Claire Tomlin and Mark Greenstreet, editors, Hybrid Systems : Computation and Control, volume 2289 of Lecture Notes in Computer Science, pages Springer Berlin / Heidelberg, Springer Berlin / Heidelberg, [21] Franck Cassez, Jan Jakob Jessen, Kim Guldstrand Larsen, Jean-François Raskin, and Pierre-Alain Reynier. Automatic synthesis of robust and optimal controllers - an industrial case study. In HSCC, pages , [22] Rohit Chadha, Steve Kremer, and Andre Scedrov. Formal analysis of multi-party contract signing. In CSFW, pages , [23] Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Algorithms for omega-regular games with imperfect information. In CSL, pages , [24] Sébastien Collette, Jean-François Raskin, and Frédéric Servais. On the symbolic computation of the hardest configurations of the rush hour game. In Computers and Games, pages , [25] Patrick Cousot, Pierre Ganty, and Jean-François Raskin. Fixpoint-guided abstraction refinements. In SAS, pages , 2
3 [26] Martin De Wulf, Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Antichains : A new algorithm for checking universality of finite automata. In CAV, pages 17 30, [27] Martin De Wulf, Laurent Doyen, Nicolas Maquet, and Jean-François Raskin. Alaska : Antichains for logic, automata and symbolic kripke structures analysis. In ATVA, pages , [28] Martin De Wulf, Laurent Doyen, Nicolas Maquet, and Jean-François Raskin. Antichains : Alternative algorithms for ltl satisfiability and model-checking. In TA- CAS, pages 63 77, [29] Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin. Robustness and implementability of timed automata. In FORMATS/FTRTFT, pages , [30] Martin De Wulf, Laurent Doyen, Nicolas Markey, and Jean-François Raskin. Robust safety of timed automata. Formal Methods in System Design, 33(1-3) :45 84, [31] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Almost asap semantics : From timed models to timed implementations. In HSCC, pages , [32] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Almost asap semantics : from timed models to timed implementations. Formal Asp. Comput., 17(3) : , [33] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. Systematic implementation of real-time models. In FM, pages , [34] Martin De Wulf, Laurent Doyen, and Jean-François Raskin. A lattice theory for solving games of imperfect information. In HSCC, pages , [35] Giorgio Delzanno and Laurent Van Begin. On the dynamics of pb systems with volatile membranes. In Workshop on Membrane Computing, pages , [36] Giorgio Delzanno, Jean-François Raskin, and Laurent Van Begin. Towards the automated verification of multithreaded java programs, [37] Giorgio Delzanno, Jean-François Raskin, and Laurent Van Begin. Covering sharing trees : a compact data structure for parameterized verification. STTT, 5(2-3) : , [38] Laurent Doyen, Raffaella Gentilini, and Jean-François Raskin. Faster pseudopolynomial algorithms for mean-payoff games, [39] Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Automatic rectangular refinement of affine hybrid systems. In FORMATS, pages , [40] Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Equivalence of labeled markov chains. Int. J. Found. Comput. Sci., 19(3) : , [41] Laurent Doyen, Thomas A. Henzinger, and Jean-François Raskin. Equivalence of labeled markov chains. Inernational Journal of Foundations of Computer Science, 19(3) : ,
4 [42] Laurent Doyen and Jean-François Raskin. Improved algorithms for the automatabased approach to model-checking. In TACAS, pages , [43] Laurent Doyen and Jean-François Raskin. Improved algorithms for the automatabased approach to model checking. Journal of Logical Methods in Computer Science, [44] Javier Esparza, Pierre Ganty, and Stefan Schwoon. Locality-based abstractions. In SAS, pages , [45] Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, and Frédéric Servais. Height-bounded memory visibly pushdown transductions. In Submitted, [46] Emmanuel Filiot, Naiyong Jin, and Jean-François Raskin. An antichain algorithm for ltl realizability. In CAV, pages , [47] Emmanuel Filiot, Naiyong Jin, and Jean-François Raskin. Compositional algorithms for ltl synthesis. In ATVA, pages , [48] Emmanuel Filiot, Tristan Le Gall, and Jean-François Raskin. Iterated regret minimization in game graphs. In MFCS, pages , [49] Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, and Jean-Marc Talbot. On functionality of visibly pushdown transducers. CoRR, abs/ , [50] Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, and Jean-Marc Talbot. Properties of visibly pushdown transducers. In MFCS, pages , [51] Emmanuel Filiot, Jean-Marc Talbot, and Sophie Tison. Tree automata with global constraints. Int. J. Found. Comput. Sci., 21(4) : , [52] Alain Finkel, Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. On the omega-language expressive power of extended petri nets. Electr. Notes Theor. Comput. Sci., 128(2) :87 101, [53] Alain Finkel, Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. On the omega-language expressive power of extended petri nets. Theoretical Computer Science, 356(3) : , [54] Alain Finkel, Jean-François Raskin, Mathias Samuelides, and Laurent Van Begin. Monotonic extensions of petri nets : Forward and backward search revisited. In In INFINITY 2002, page Elsevier, Elsevier, [55] Pierre Ganty, Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Le problème de couverture pour les réseaux de petri. résultats classiques et développements récents. Technique et Science Informatiques, 28(9) : , [56] Pierre Ganty, Nicolas Maquet, and Jean-François Raskin. Fixpoint guided abstraction refinement for alternating automata. In CIAA, pages , [57] Pierre Ganty, Jean-François Raskin, and Laurent Van Begin. A complete abstract interpretation framework for coverability properties of wsts. In VMCAI, pages 49 64,
5 [58] Pierre Ganty, Jean-François Raskin, and Laurent Van Begin. From many places to few : Automatic abstraction refinement for petri nets. In ICATPN, pages , [59] Pierre Ganty, Jean-François Raskin, and Laurent Van Begin. From many places to few : Automatic abstraction refinement for petri nets. Fundam. Inform., 88(3) : , [60] Gilles Geeraerts, Gabriel Kalyon, Tristan Le Gall, Nicolas Maquet, and Jean- François Raskin. Lattice-valued binary decision diagrams. In ATVA, pages , [61] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, enlarge, and check : New algorithms for the coverability problem of wsts. In FSTTCS, pages , [62] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, enlarge and check... made efficient. In CAV, pages , [63] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Expand, enlarge and check : New algorithms for the coverability problem of wsts. J. Comput. Syst. Sci., 72(1) : , [64] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. On the efficient computation of the minimal coverability set for petri nets. In ATVA, pages , [65] Gilles Geeraerts, Jean-François Raskin, and Laurent Van Begin. Well-structured languages. Acta Inf., 44(3-4) : , [66] Alexandre Genon, Thierry Massart, and Cédric Meuter. Monitoring distributed controllers : When an efficient ltl algorithm on sequences is needed to modelcheck traces. In FM, pages , [67] Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, and Thierry Massart. Computational complexity for state-feedback controllers with partial observation. In Proc. of the 7th IEEE International Conference on Control & Automation (IC- CA 09), Christchurch, New Zealand, [68] Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, and Thierry Massart. Control of infinite symbolic transition systems under partial observation. In European Control Conference, pages , Budapest, Hungary, August [69] Gabriel Kalyon, Tristan Le Gall, Hervé Marchand, and Thierry Massart. Contrôle décentralisé de systèmes symboliques infinis sous observation partielle. Journal Européen des Systèmes Automatisés (7ème Colloque Francophone sur la Modélisation des Systèmes Réactifs), 43/ : , [70] Gabriel Kalyon, Thierry Massart, Cédric Meuter, and Laurent Van Begin. Testing distributed systems through symbolic model checking. In FORTE, pages , [71] Gabriel Kalyon, Thierry Massart, Cédric Meuter, and Laurent Van Begin. Testing distributed systems through symbolic model checking. In John Derrick and Jüri Vain, editors, Formal Techniques for Networked and Distributed Systems 5
6 FORTE 2007, volume 4574 of Lecture Notes in Computer Science, pages Springer Berlin / Heidelberg, Springer Berlin / Heidelberg, [72] Steve Kremer and Jean-François Raskin. Game analysis of abuse-free contract signing. In In Proc. 15th IEEE Computer Security Foundations Workshop, page IEEE Computer Society, IEEE Computer Society, [73] Steve Kremer and Jean-François Raskin. A game-based verification of nonrepudiation and fair exchange protocols. In Journal of Computer Security, page Springer-Verlag, Springer-Verlag, [74] Michael Leuschel and Thierry Massart. Logic programming and partial deduction for the verification of reactive systems : An experimental evaluation. Technical report, University of Southampton [School of Electronics and Computer Science] [http ://eprints.ecs.soton.ac.uk/perl/oai2] (United Kingdom), [75] Michael Leuschel and Thierry Massart. Efficient approximate verification of b via symmetry markers. Proceedings International Symmetry Conference, [76] Nicolas Markey and Jean-François Raskin. Model checking restricted sets of timed paths. In CONCUR, pages , [77] Nicolas Markey and Jean-François Raskin. Model checking restricted sets of timed paths. Theor. Comput. Sci., 358(2-3) : , [78] Thierry Massart, Cédric Meuter, and Laurent Van Begin. On the complexity of partial order trace model checking. Inf. Process. Lett., 106(3) : , [79] Thierry Massart, Jean-François Raskin, and Laurent Van Begin. Symbolic distributed verification of a class of parametric concurrent systems, [80] Jean-François Raskin. An Introduction to Hybrid Automata, pages Springer, [81] Jean-François Raskin. Controller synthesis using lattice theory (invited tutorial). In IEEE conference on Decision and Control, pages , [82] Jean-François Raskin and Laurent Van Begin. Petri nets with non-blocking arcs are difficult to analyze. Electr. Notes Theor. Comput. Sci., 98 :35 55, [83] Jean-François Raskin, Krishnendu Chatterjee, Laurent Doyen, and Thomas A. Henzinger. Algorithms for omega-regular games with imperfect information. Logical Methods in Computer Science, 3(3), [84] Jean-François Raskin, Mathias Samuelides, and Laurent Van Begin. Petri games are monotone but difficult to decide, [85] Jean-François Raskin and Frédéric Servais. Visibly pushdown transducers. In ICALP (2), pages , [86] Bram De Wachter, Alexandre Genon, and Thierry Massart. From static code distribution to more shrinkage for the multiterminal cut. In WEA, pages , [87] Bram De Wachter, Alexandre Genon, Thierry Massart, and Cédric Meuter. The formal design of distributed controllers with dsl and spin. Formal Asp. Comput., 17(2) : ,
Verification in Continuous Time Recent Advances
Verification in Continuous Time Recent Advances Hongyang Qu Department of Automatic Control and Systems Engineering University of Sheffield 10 March 2017 Outline Motivation Probabilistic models Real-time
More informationModel-based GUI testing using Uppaal at NOVO Nordisk
Model-based GUI testing using Uppaal at NOVO Nordisk Ulrik H. Hjort 2, Jacob Illum 1, Kim G. Larsen 1, Michael A. Petersen 2, and Arne Skou 1 1 Department of Computer Science, Aalborg University, Denmark
More informationALASKA Antichains for Logic, Automata and Symbolic Kripke structures Analysis
ALASKA Antichains for Logic, Automata and Symbolic Kripke structures Analysis M. De Wulf 1, L. Doyen 2, N. Maquet 1 and J.-F. Raskin 1 1 Université Libre de Bruxelles (ULB), Belgium 2 École Polytechnique
More informationLecture 6. Abstract Interpretation
Lecture 6. Abstract Interpretation Wei Le 2014.10 Outline Motivation History What it is: an intuitive understanding An example Steps of abstract interpretation Galois connection Narrowing and Widening
More informationM. De Wulf, L. Doyen,J.-F. Raskin Université Libre de Bruxelles Centre Fédéré en Vérification
Systematic Implementation of Real-Time Models M. De Wulf, L. Doyen,J.-F. Raskin Université Libre de Bruxelles Centre Fédéré en Vérification Model-based Development for Controllers Make a model of the environment
More informationCOMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University
Eugene Syriani Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science McGill University 1 OVERVIEW In the context In Theory: Timed Automata The language: Definitions and Semantics
More informationQuantitative analysis of real-time systems
Quantitative analysis of real-time systems Patricia Bouyer bouyer@lsv.ens-cachan.fr Kim G. Larsen kgl@cs.aau.dk LSV CNRS & ENS Cachan 6 avenue du Président Wilson 9 Cachan France Uli Fahrenberg uli@cs.aau.dk
More informationBeyond Model Checking: Parameters Everywhere
Beyond Model Checking: Parameters Everywhere Étienne André 1, Benoît Delahaye 2, Peter Habermehl 3, Claude Jard 2, Didier Lime 4, Laure Petrucci 1, Olivier H. Roux 4, Tayssir Touili 3 1 Université Paris
More informationPriced Timed Automata and Timed Games. Kim G. Larsen Aalborg University, DENMARK
Priced Timed Automata and Timed Games Kim G. Larsen Aalborg University, DENMARK Scheduling Priced Timed Automata and Synthesis Timed Games Kim G. Larsen Aalborg University, DENMARK Overview Timed Automata
More informationKahina Gani, Marinette Bouet, Michel Schneider, and Farouk Toumani. 1 2
Modeling Home Care Plans Kahina Gani, Marinette Bouet, Michel Schneider, and Farouk Toumani. 1 2 Research Report LIMOS/RR-14-02 12 mai 2014 1. {gani,michel.schneider,ftoumani}@isima.fr 2. marinette.bouet@univ-bpclermont.fr
More informationAutomatic synthesis of switching controllers for linear hybrid systems: Reachability control
Automatic synthesis of switching controllers for linear hybrid systems: Reachability control Massimo Benerecetti and Marco Faella Università di Napoli Federico II, Italy Abstract. We consider the problem
More informationDeveloping Uppaal over 15 Years
Developing Uppaal over 15 Years Gerd Behrmann 1, Alexandre David 2, Kim Guldstrand Larsen 2, Paul Pettersson 3, and Wang Yi 4 1 NORDUnet A/S, Copenhagen, Denmark 2 Department of Computer Science, Aalborg
More informationAalborg Universitet. Published in: Lecture Notes in Computer Science. DOI (link to publication from Publisher): / _29
Aalborg Universitet ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems David, Alexandre; Larsen, Kim Guldstrand; Nyman, Ulrik Mathias; Legay, Axel; Wasowski, Andrzej Published
More informationTAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets Joakim Byg, Kenneth Yrke Jørgensen, and Jiří Srba Department of Computer Science, Aalborg University, Selma Lagerlöfs Vej 300, 9220 Aalborg
More informationopaal: A Lattice Model Checker
opaal: A Lattice Model Checker Andreas Engelbredt Dalsgaard, René Rydhof Hansen, Kenneth Yrke Jørgensen, Kim Gulstrand Larsen, Mads Chr. Olesen, Petur Olsen, and Jiří Srba Department of Computer Science,
More informationThe Maude LTL Model Checker and Its Implementation
The Maude LTL Model Checker and Its Implementation Steven Eker 1,José Meseguer 2, and Ambarish Sridharanarayanan 2 1 Computer Science Laboratory, SRI International Menlo Park, CA 94025 eker@csl.sri.com
More informationCoverability Graph and Fairness
Coverability Graph and Fairness prof.dr.ir. Wil van der Aalst www.vdaalst.com Recall reachability analysis or1 x r1 rg1 g1 go1 o1 r2 rg2 g2 go2 o2 or2 Petri net standard properties Boundedness Terminating
More informationFault Detection of Reachability Testing with Game Theoretic Approach
Fault Detection of Reachability Testing with Game Theoretic Approach S. Preetha Dr.M. Punithavalli Research Scholar, Karpagam University, Coimbatore. Director, Sri Ramakrishna Engineering College, Coimbatore.
More informationCAV th July 2013 Saint Petersburg, Russia. PSyHCoS. Parameter Synthesis for Hierarchical Concurrent Real-Time Systems
CAV 2013 18th July 2013 Saint Petersburg, Russia PSyHCoS Parameter Synthesis for Hierarchical Concurrent Real-Time Systems Étienne André, Yang Liu, Jun Sun, Jin Song Dong, Shang-Wei Lin Temasek Laboratories
More informationSpecification and Analysis of Real-Time Systems Using Real-Time Maude
Specification and Analysis of Real-Time Systems Using Real-Time Maude Peter Csaba Ölveczky1,2 and José Meseguer 1 1 Department of Computer Science, University of Illinois at Urbana-Champaign 2 Department
More informationPerformance Evaluation
A not so Short Introduction Why, Who, When and How? Jean-Marc Vincent 12 1 Laboratoire LIG, projet Inria-Mescal UniversitéJoseph Fourier Jean-Marc.Vincent@imag.fr 2 LICIA Laboratoire International de Calcul
More informationTutorial on Model Checking Modelling and Verification in Computer Science
Tutorial on Model Checking Modelling and Verification in Computer Science Armin Biere Institute for Formal Models and Verification Johannes Kepler University, Linz, Austria Abstract. This paper serves
More informationA Test Case Generation Algorithm for Real-Time Systems
A Test Case Generation Algorithm for Real-Time Systems Anders Hessel and Paul Pettersson Department of Information Technology Uppsala University, P.O. Box 337 SE-751 05 Uppsala, Sweden {hessel,paupet}@it.uu.se
More informationAction Language Verifier, Extended
Action Language Verifier, Extended Tuba Yavuz-Kahveci 1, Constantinos Bartzis 2, and Tevfik Bultan 3 1 University of Florida 2 Carnegie Mellon University 3 UC, Santa Barbara 1 Introduction Action Language
More informationEECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization
EECS 144/244: Fundamental Algorithms for System Modeling, Analysis, and Optimization Dataflow Lecture: SDF, Kahn Process Networks Stavros Tripakis University of California, Berkeley Stavros Tripakis: EECS
More informationRT-Studio: A tool for modular design and analysis of realtime systems using Interpreted Time Petri Nets
RT-Studio: A tool for modular design and analysis of realtime systems using Interpreted Time Petri Nets Rachid Hadjidj and Hanifa Boucheneb Abstract. RT-Studio (Real Time Studio) is an integrated environment
More informationAVERIST: An Algorithmic Verifier for Stability
Available online at www.sciencedirect.com Electronic Notes in Theoretical Computer Science 317 (2015) 133 139 www.elsevier.com/locate/entcs AVERIST: An Algorithmic Verifier for Stability Pavithra Prabhakar
More information2 after reception of a message from the sender, do one of two things: either the message is delivered to the receiver, or it is lost. The loss of a me
Protocol Verification using UPPAAL: Exercises? Lab assistant: Alexandre David Department of Computer Systems (room 1237, mailbox 26), Uppsala University, Box 325, S751 05, Uppsala. Phone: 018-18 73 41.
More informationAn Introduction to UPPAAL. Purandar Bhaduri Dept. of CSE IIT Guwahati
An Introduction to UPPAAL Purandar Bhaduri Dept. of CSE IIT Guwahati Email: pbhaduri@iitg.ernet.in OUTLINE Introduction Timed Automata UPPAAL Example: Train Gate Example: Task Scheduling Introduction UPPAAL:
More informationQualitative Analysis of WorkFlow nets using Linear Logic: Soundness Verification
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Qualitative Analysis of WorkFlow nets using Linear Logic: Soundness Verification
More informationTimed Automata From Theory to Implementation
Timed Automata From Theory to Implementation Patricia Bouyer LSV CNRS & ENS de Cachan France Chennai january 2003 Timed Automata From Theory to Implementation p.1 Roadmap Timed automata, decidability issues
More informationStatic Analysis by A. I. of Embedded Critical Software
Static Analysis by Abstract Interpretation of Embedded Critical Software Julien Bertrane ENS, Julien.bertrane@ens.fr Patrick Cousot ENS & CIMS, Patrick.Cousot@ens.fr Radhia Cousot CNRS & ENS, Radhia.Cousot@ens.fr
More informationAutomatic Verification of Directory-based Consistency Protocols
Automatic Verification of Directory-based Consistency Protocols Parosh Aziz Abdulla 1 parosh@it.uu.se, Giorgio Delzanno 2 giorgio@disi.unige.it, and Ahmed Rezine 3 rezine.ahmed@liafa.jussieu.fr 1 Uppsala
More informationTIMES A Tool for Modelling and Implementation of Embedded Systems
TIMES A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi Uppsala University, Sweden. {tobiasa,elenaf,leom,paupet,yi}@docs.uu.se.
More informationState Identification In The Hybrid Automata Description Of Dynamical Systems
State Identification In The Hybrid Automata Description Of Dynamical Systems ISABELLA KOTINI, GEORGE HASSAPIS Dept. of Electrical and Computer Engineering Aristotle University of Thessaloniki 54006, Thessaloniki
More informationTesting and Verification
Final Review Brussels, December 12th, 2008 Achievements and Perspectives : Testing and Verification Cluster leader : Kim Guldstrand Larsen CISS, Aalborg University, DENMARK Core Partners of the Cluster
More informationConstructing Control Flow Graph for Java by Decoupling Exception Flow from Normal Flow
Constructing Control Flow Graph for Java by Decoupling Exception Flow from Normal Flow Jang-Wu Jo 1 and Byeong-Mo Chang 2 1 Department of Computer Engineering Pusan University of Foreign Studies Pusan
More informationLecture 9: Reachability
Lecture 9: Reachability Outline of Lecture Reachability General Transition Systems Algorithms for Reachability Safety through Reachability Backward Reachability Algorithm Given hybrid automaton H : set
More informationModeling and Verification of Real-Time Systems
Modeling and Verification of Real-Time Systems Formalisms and Software Tools Edited by Stephan Merz Nicolas Navet This page intentionally left blank Modeling and Verification of Real-Time Systems This
More informationDynamic Clock Elimination in Parametric Timed Automata
FSFMA 2013 16th July 2013 Singapore Dynamic Clock Elimination in Parametric Timed Automata Étienne André Laboratoire d'informatique de Paris Nord Université Paris 13, Sorbonne Paris Cité Étienne André
More informationEliminating the Storage Tape in Reachability Constructions
Eliminating the Storage Tape in Reachability Constructions Oscar H. Ibarra Department of Computer Science University of California Santa Barbara, CA 93106, USA Zhe Dang School of Electrical Engineering
More informationParallel Model Checking of ω-automata
Parallel Model Checking of ω-automata Vincent Bloemen Formal Methods and Tools, University of Twente v.bloemen@utwente.nl Abstract. Specifications for non-terminating reactive systems are described by
More informationDynamic Cutoff Detection in Parameterized Concurrent Programs
Dynamic Cutoff Detection in Parameterized Concurrent Programs Alexander Kaiser, Daniel Kroening, and Thomas Wahl Oxford University Computing Laboratory, United Kingdom Abstract. The verification problem
More informationLock-sensitive Interference Analysis for Java: Combining Program Dependence Graphs with Dynamic Pushdown Networks
Lock-sensitive Interference Analysis for Java: Combining Program Dependence Graphs with Dynamic Pushdown Networks Jürgen Graf 1, Martin Hecker 1, Martin Mohr 1, and Benedikt Nordhoff 2 1 Karlsruhe Institute
More informationJava-MOP: A Monitoring Oriented Programming Environment for Java
Java-MOP: A Monitoring Oriented Programming Environment for Java Feng Chen and Grigore Roşu Department of Computer Science, University of Illinois at Urbana - Champaign, USA {fengchen, grosu}@uiuc.edu
More informationLeveraging DTrace for runtime verification
Leveraging DTrace for runtime verification Carl Martin Rosenberg June 7th, 2016 Department of Informatics, University of Oslo Context: Runtime verification Desired properties System Every request gets
More informationTVLA: A SYSTEM FOR GENERATING ABSTRACT INTERPRETERS*
TVLA: A SYSTEM FOR GENERATING ABSTRACT INTERPRETERS* Tal Lev-Ami, Roman Manevich, and Mooly Sagiv Tel Aviv University {tla@trivnet.com, {rumster,msagiv}@post.tau.ac.il} Abstract TVLA (Three-Valued-Logic
More informationFrom Analysis to Code Generation of Distributed Systems with a UML-Based Formal Environment Named TURTLE 2005
From Analysis to Code Generation of Distributed Systems with a UML-Based Formal Environment Named TURTLE 2005 Ludovic Apvrille ludovic.apvrille@enst.fr Eurecom, Office 223 Ludovic Apvrille - October 12,
More informationTrading Memory for Randomness
Trading Memory for Randomness Krishnendu Chatterjee Luca de Alfaro Thomas A. Henzinger EECS, University of California, Berkeley,USA CE, University of California, Santa Cruz,USA Computer and Communication
More informationUPPAAL. Validation and Verication of Real Time Systems. Status & Developments y. Abstract
UPPAAL Validation and Verication of Real Time Systems Status & Developments y Kim G Larsen z Paul Pettersson x Wang Yi x Abstract Uppaal is a tool box for validation (via graphical simulation) and verication
More informationFrom Boolean to Quantitative Synthesis
From Boolean to Quantitative Synthesis Pavol Černý IST Austria cernyp@ist.ac.at Thomas A. Henzinger IST Austria tah@ist.ac.at ABSTRACT Motivated by improvements in constraint-solving technology and by
More informationReal-Time Model-Checking: Parameters Everywhere
"!$#&%(*)+#-,(00!4(57(9(:=*?*?*@BADC$E FHGJIKDLMNPOQG R SUT G
More informationModel checking pushdown systems
Model checking pushdown systems R. Ramanujam Institute of Mathematical Sciences, Chennai jam@imsc.res.in Update Meeting, IIT-Guwahati, 4 July 2006 p. 1 Sources of unboundedness Data manipulation: integers,
More informationECDAR: An Environment for Compositional Design and Analysis of Real Time Systems
ECDAR: An Environment for Compositional Design and Analysis of Real Time Systems AlexandreDavid 1,Kim.G.Larsen 1,AxelLegay 2, UlrikNyman 1,AndrzejWąsowski 3 1 ComputerScience,AalborgUniversity,Denmark
More informationProseminar. (with Eclipse) Jun.-Prof. Dr.-Ing. Steffen Becker. Model-Driven Software Engineering. Software Engineering Group
Proseminar Model-Driven Software Engineering (with Eclipse) Jun.-Prof. Dr.-Ing. Steffen Becker Model-Driven Software Engineering Software Engineering Group 1 Outline Basic Requirements Preliminary Dates
More informationPetri-net-based Workflow Management Software
Petri-net-based Workflow Management Software W.M.P. van der Aalst Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB, Eindhoven, The Netherlands,
More informationANDREAS PIERIS JOURNAL PAPERS
ANDREAS PIERIS School of Informatics, University of Edinburgh Informatics Forum, 10 Crichton Street, Edinburgh, EH8 9AB, Scotland, UK apieris@inf.ed.ac.uk PUBLICATIONS (authors in alphabetical order) JOURNAL
More informationPRISM 4.0: Verification of Probabilistic Real-Time Systems
PRISM 4.0: Verification of Probabilistic Real-Time Systems Marta Kwiatkowska 1,GethinNorman 2,andDavidParker 1 1 Department of Computer Science, University of Oxford, Oxford, OX1 3QD, UK 2 School of Computing
More informationXuandong Li. BACH: Path-oriented Reachability Checker of Linear Hybrid Automata
BACH: Path-oriented Reachability Checker of Linear Hybrid Automata Xuandong Li Department of Computer Science and Technology, Nanjing University, P.R.China Outline Preliminary Knowledge Path-oriented Reachability
More informationFurther Topics in Modelling & Verification
Further Topics in Modelling & Verification Thursday Oct 09, 2014 Philipp Rümmer Uppsala University Philipp.Ruemmer@it.uu.se 1/34 Recap: Timed automata (TA) 2/34 Recap: Properties 3/34 Questions about TA
More informationStatic analysis and testing of executable DSL specification
Static analysis and testing of executable DSL specification Qinan Lai 1, Andy Carpenter 1 1 School of Computer Science, the University of Manchester, Manchester, UK {laiq,afc}@cs.man.ac.uk Keywords: Abstract:
More informationJPF SE: A Symbolic Execution Extension to Java PathFinder
JPF SE: A Symbolic Execution Extension to Java PathFinder Saswat Anand 1,CorinaS.Păsăreanu 2, and Willem Visser 2 1 College of Computing, Georgia Institute of Technology saswat@cc.gatech.edu 2 QSS and
More informationWidening Operator. Fixpoint Approximation with Widening. A widening operator 2 L ˆ L 7``! L is such that: Correctness: - 8x; y 2 L : (y) v (x y)
EXPERIENCE AN INTRODUCTION WITH THE DESIGN TOF A SPECIAL PURPOSE STATIC ANALYZER ABSTRACT INTERPRETATION P. Cousot Patrick.Cousot@ens.fr http://www.di.ens.fr/~cousot Biarritz IFIP-WG 2.3 2.4 meeting (1)
More informationProof Pearl: The Termination Analysis of Terminator
Proof Pearl: The Termination Analysis of Terminator Joe Hurd Computing Laboratory Oxford University joe.hurd@comlab.ox.ac.uk Abstract. Terminator is a static analysis tool developed by Microsoft Research
More informationFrom Timed Automata to Stochastic Hybrid Games
From Timed Automata to Stochastic Hybrid Games Model Checking, Performance Analysis, Optimization, Synthesis, and Machine Learning Kim G. Larsen Aalborg University, DENMARK Topics Timed Automata Decidability
More informationTimed Automata with Asynchronous Processes: Schedulability and Decidability
Timed Automata with Asynchronous Processes: Schedulability and Decidability Elena Fersman, Paul Pettersson and Wang Yi Uppsala University, Sweden Abstract. In this paper, we exend timed automata with asynchronous
More informationVerification of Higher-Order Computation: A Game-Semantic Approach
Verification of Higher-Order Computation: A Game-Semantic Approach C.-H. L. Ong Oxford University Computing Laboratory users.comlab.ox.ac.uk/luke.ong/ Abstract. We survey recent developments in an approach
More information中国计算机学会推荐国际学术期刊 ( 计算机科学理论 ) 序号 刊物简称 刊物全称 出版社 网址
中国计算机学会推荐国际学术期刊 ( 计算机科学理论 ) 一 A 类 序号 刊物简称 刊物全称 出版社 网址 1 IANDC Information and Computation Elsevier http://dblp.uni-trier.de/db/journals/iandc/ 2 SICOMP SIAM Journal on Computing SIAM http://dblp.uni-trier.de/db/journals/siamcomp/
More informationAcceleration of Affine Hybrid Transformations
Acceleration of Affine Hybrid Transformations Bernard Boigelot 1, Frédéric Herbreteau 2, and Isabelle Mainz 1 1 Institut Montefiore, B28, Univ. Liège, Belgium {boigelot,mainz}@montefiore.ulg.ac.be 2 Univ.
More informationPRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games
PRISM-games 2.0: A Tool for Multi-Objective Strategy Synthesis for Stochastic Games Marta Kwiatkowska 1, David Parker 2, and Clemens Wiltsche 1 1 Department of Computer Science, University of Oxford, UK
More informationFormal Modeling of BPEL Workflows Including Fault and Compensation Handling
Formal Modeling of BPEL Workflows Including Fault and Compensation Handling Máté Kovács, Dániel Varró, László Gönczy kovmate@mit.bme.hu Budapest University of Technology and Economics Dept. of Measurement
More informationSymbolic Automata Library for Fast Prototyping
http://excel.fit.vutbr.cz Symbolic Automata Library for Fast Prototyping Michaela Bieliková not_in{@} in{e,x,c} in{e,l} F I T Abstract Finite state automata are widely used in the fields of computer science
More informationUSING TIME PETRI NETS FOR MODELING AND VERIFICATION OF TIMED CONSTRAINED WORKFLOW SYSTEMS
ABCM Symposium Series in Mechatronics - Vol. 3 - pp.471-478 Copyright c 2008 by ABCM USING TIME PETRI NETS FOR MODELING AND VERIFICATION OF TIMED CONSTRAINED WORKFLOW SYSTEMS Pedro M. Gonzalez del Foyo,
More informationLecture 2. Decidability and Verification
Lecture 2. Decidability and Verification model temporal property Model Checker yes error-trace Advantages Automated formal verification, Effective debugging tool Moderate industrial success In-house groups:
More informationPRISM An overview. automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation,
PRISM An overview PRISM is a probabilistic model checker automatic verification of systems with stochastic behaviour e.g. due to unreliability, uncertainty, randomisation, Construction/analysis of probabilistic
More informationA Novel Approach for Software Property Validation
A Novel Approach for Software Property Validation Salamah Salamah Department of Computer and Software Engineering, Embry-Riddle Aeronautical University, salamahs@erau.edu. Irbis Gallegos, Omar Ochoa Computer
More informationThe Verification Grand Challenge and Abstract Interpretation
The Verification Grand Challenge and Abstract Interpretation Patrick Cousot École normale supérieure, 45 rue d Ulm 75230 Paris cedex 05, France Patrick.Cousot ens fr Visiting the Aeronautics and Astronautics
More informationQuantitative Verification and Synthesis of Systems
Quantitative Verification and Synthesis of Systems Sanjit A. Seshia Assistant Professor EECS, UC Berkeley Software-at-Scale Workshop August 2010 Quantitative Analysis / Verification Does the brake-by-wire
More informationHierarchical Petri Net Simulator: Simulation, Design Validation, and Model Checking Tool for Hierarchical Place/Transition Petri Nets
Hierarchical Petri Net Simulator: Simulation, Design Validation, and Model Checking Tool for Hierarchical Place/Transition Petri Nets Yojiro Harie and Katsumi Wasaki Interdisciplinary Graduate School of
More informationAbstract Interpretation Based Static Analysis Parameterized by Semantics
Abstract Interpretation Based Static Analysis Parameterized by Semantics () Patrick Cousot École normale supérieure, DMI, 45 rue d Ulm, 75230 Paris cedex 05, France cousot@dmi.ens.fr http://www.dmi.ens.fr/
More informationCalculational Design of Semantics and Static Analyzers by Abstract Interpretation
Calculational Design of Semantics and Static Analyzers by Abstract Interpretation Patrick Cousot École Normale Supérieure DMI, 45, rue d Ulm 75230 Paris cedex 05 France cousot@dmi.ens.fr http://www.dmi.ens.fr/
More informationThe 4th Reactive Synthesis Competition - SYNTCOMP 2017
The 4th Reactive Synthesis Competition - SYNTCOMP 2017 Swen Jacobs Saarland University Roderick Bloem TU Graz 22 July 2017 SYNT Workshop, Heidelberg SYNTCOMP: Goals Make reactive synthesis tools comparable:
More informationProPed. Tool for Symbolic Verification of Probablistic Recursive Programs. University of Missouri Columbia, Missouri, USA
ProPed Tool for Symbolic Verification of Probablistic Recursive Programs Rohit Chadha 1 Umang Mathur 2 Stefan Schwoon 3 1 Computer Science Department University of Missouri Columbia, Missouri, USA 2 Department
More informationStatistical Model Checking in UPPAAL
Statistical Model Checking in UPPAAL Alexandre David, Kim G. Larsen, Axel Legay, Marius Mikucionis Wang Zheng, Peter Bulychev, Jonas van Vliet, Danny Poulsen, Dehui Du, Guangyuan Li CAV 11, PDMC 11,FORMATS
More informationAuto-Generating Test Sequences for Web Applications *
Auto-Generating Test Sequences for Web Applications * Hongwei Zeng and Huaikou Miao School of Computer Engineering and Science, Shanghai University, 200072, China zenghongwei@shu.edu.cn, hkmiao@shu.edu.cn
More informationFormal Methods in CPS
Formal Methods in CPS A Computer Science Perspective Kim G. Larsen Aalborg University, DENMARK From Timed Automata to Stochastic Hybrid Games Model Checking, Performance Evaluation and Synthesis Kim G.
More informationProc. XVIII Conf. Latinoamericana de Informatica, PANEL'92, pages , August Timed automata have been proposed in [1, 8] to model nite-s
Proc. XVIII Conf. Latinoamericana de Informatica, PANEL'92, pages 1243 1250, August 1992 1 Compiling Timed Algebras into Timed Automata Sergio Yovine VERIMAG Centre Equation, 2 Ave de Vignate, 38610 Gieres,
More informationImproved BDD-based Discrete Analysis of Timed Systems
Improved BDD-based Discrete Analysis of Timed Systems Truong Khanh Nguyen 1, Jun Sun 2, Yang Liu 1, Jin Song Dong 1 and Yan Liu 1 1 School of Computing National University of Singapore 2 Information System
More informationEnumerating Pseudo-Intents in a Partial Order
Enumerating Pseudo-Intents in a Partial Order Alexandre Bazin and Jean-Gabriel Ganascia Université Pierre et Marie Curie, Laboratoire d Informatique de Paris 6 Paris, France Alexandre.Bazin@lip6.fr Jean-Gabriel@Ganascia.name
More informationTemporal logic-based decision making and control. Jana Tumova Robotics, Perception, and Learning Department (RPL)
Temporal logic-based decision making and control Jana Tumova Robotics, Perception, and Learning Department (RPL) DARPA Urban Challenge 2007 2 Formal verification Does a system meet requirements? System
More informationPast Pushdown Timed Automata and Safety Verification
Past Pushdown Timed Automata and Safety Verification Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, and Richard A. Kemmerer Abstract We consider past pushdown timed automata that are discrete pushdown timed
More informationSuggesting Edits to Explain Failing Traces
Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a
More informationDynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massac
Dynamic Logic David Harel, The Weizmann Institute Dexter Kozen, Cornell University Jerzy Tiuryn, University of Warsaw The MIT Press, Cambridge, Massachusetts, 2000 Among the many approaches to formal reasoning
More informationParametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems
FTSCS 2013 30th October 2013 Queenstown, New Zealand Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems Youcheng Sun 1, Romain Soulat 2, Giuseppe Lipari 1,2, Étienne André
More informationQuantitative Synthesis for Concurrent Programs,
Quantitative Synthesis for Concurrent Programs, Pavol Černý1, Krishnendu Chatterjee 1, Thomas A. Henzinger 1, Arjun Radhakrishna 1, and Rohit Singh 2 1 IST Austria 2 IIT Bombay Abstract. We present an
More informationEditor. Analyser XML. Scheduler. generator. Code Generator Code. Scheduler. Analyser. Simulator. Controller Synthesizer.
TIMES - A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi? Uppsala University, Sweden Abstract. Times is a new modelling,
More informationStochastic Games for Verification of Probabilistic Timed Automata
Stochastic ames for Verification of Probabilistic Timed Automata Marta Kwiatkowska, ethin Norman, and David Parker Oxford University Computing Laboratory, Parks Road, Oxford, OX1 3QD Abstract. Probabilistic
More informationAutomatic Verification of Closures and Lambda-Functions in Python Master s Thesis Project Description
Automatic Verification of Closures and Lambda-Functions in Python Master s Thesis Project Description Benjamin Weber March 2017 Introduction Higher-order functions take other functions as parameters. Thus,
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Stavros Tripakis, Edward A. Lee UC Berkeley EECS 144/244 Fall 2014 Copyright 2014, E. A. Lee, J. Roydhowdhury, S. A. Seshia, S. Tripakis
More informationwant turn==me wait req2==0
Uppaal2k: Small Tutorial Λ 16 October 2002 1 Introduction This document is intended to be used by new comers to Uppaal and verification. Students or engineers with little background in formal methods should
More information