Publications
| 2020 | |
| [318] | Extracting symbolic transitions from TLA+ specifications Science of Computer Programming, volume 187, pages 102361, 2020. |
| [317] | Tutorial: Parameterized Verification with Byzantine Model Checker FORTE 2020, pages 189–207, 2020. |
| 2019 | |
| [316] | Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries 30th International Conference on Concurrency Theory (CONCUR 2019) (Wan Fokkink, Rob van Glabbeek, eds.), volume 140 of Leibniz International Proceedings in Informatics (LIPIcs), pages 33:1–33:15, 2019, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [315] | Verifying Safety of Synchronous Fault-Tolerant Algorithms Bounded Model Checking Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part II, pages 357–374, 2019. Note: A pre-print including the proofs is available at: https://hal.inria.fr/hal-01925653 |
| [314] | Communication-Closed Asynchronous Protocols Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, pages 344–363, 2019. |
| [313] | TLA+ model checking made symbolic PACMPL, volume 3, number OOPSLA, pages 123:1–123:30, 2019. |
| [312] | Reachability Analysis for AWS-Based Networks Computer Aided Verification - 31st International Conference, CAV 2019, New York City, NY, USA, July 15-18, 2019, Proceedings, Part II, pages 231–241, 2019. |
| 2018 | |
| [311] | Verifying Safety of Synchronous Fault-Tolerant Algorithms by Bounded Model Checking HAL, volume hal-01925653, Nov 2018. Note: Accepted at TACAS 2019 |
| [310] | Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries HAL, volume hal-01925533, Nov 2018. |
| [309] | Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF Journal of Automated Reasoning, Sep 2018. |
| [308] | Desingularization of First Order Linear Difference Systems with Rational Function Coefficients Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2018, New York, NY, USA, July 16-19, 2018 (Manuel Kauers, Alexey Ovchinnikov, Éric Schost, eds.), pages 39–46, 2018, ACM. |
| [307] | Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part II (Hana Chockler, Georg Weissenbacher, eds.), volume 10982 of Lecture Notes in Computer Science, 2018, Springer. |
| [306] | Computer Aided Verification - 30th International Conference, CAV 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 14-17, 2018, Proceedings, Part I (Hana Chockler, Georg Weissenbacher, eds.), volume 10981 of Lecture Notes in Computer Science, 2018, Springer. |
| [305] | Local proofs and AVATAR Vampire 2017. Proceedings of the 4th Vampire Workshop (Laura Kov\textbackslash'acs, Andrei Voronkov, eds.), volume 53 of EPiC Series in Computing, pages 33–41, 2018, EasyChair. |
| [304] | Incremental Solving with Vampire Vampire 2017. Proceedings of the 4th Vampire Workshop (Laura Kov\textbackslash'acs, Andrei Voronkov, eds.), volume 53 of EPiC Series in Computing, pages 52–63, 2018, EasyChair. |
| [303] | Randomized Testing of Distributed Systems with Probabilistic Guarantees PACMPL, volume 2, number OOPSLA, 2018. Note: OOPSLA Distinguished paper award |
| [302] | Monadic refinements for relational cost analysis POPL 2018, 2018. Note: (to appear) |
| [301] | A Separation Logic with Data: Small Models and Automation International Joint Conference on Automated Reasoning (ICJAR), volume 10900 of Lecture Notes in Computer Science, pages 455–471, 2018, Springer. |
| [300] | ByMC: Byzantine Model Checker Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems, pages 327–342, 2018, Springer International Publishing. |
| [299] | Extracting Symbolic Transitions from TLA+ Specifications Abstract State Machines, Alloy, B, TLA, VDM, and Z, pages 89–104, 2018. |
| [298] | Reachability in Parameterized Systems: All Flavors of Threshold Automata 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China, pages 19:1–19:17, 2018. |
| [297] | Efficient translation of sequent calculus proofs into natural deduction proofs Proceedings of the 6th Workshop on Practical Aspects of Automated Reasoning (PAAR) (Boris Konev, Josef Urban, Philipp Rümmer, eds.), pages 17–33, 2018. |
| [296] | Reducing asynchrony to synchronized rounds arXiv, volume 1804.07078, 2018. |
| [295] | Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto Sinteza, pages 131–138, 2018. |
| [294] | Invariant Generation for Multi-Path Loops with Polynomial Assignments Verification, Model Checking, and Abstract Interpretation - 19th International Conference, VMCAI 2018, Los Angeles, CA, USA, January 7-9, 2018, Proceedings (Isil Dillig, Jens Palsberg, eds.), volume 10747 of Lecture Notes in Computer Science, pages 226–246, 2018, Springer. |
| [293] | Unification with Abstraction and Theory Instantiation in Saturation-Based Reasoning Tools and Algorithms for the Construction and Analysis of Systems - 24th International Conference, TACAS 2018, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2018, Thessaloniki, Greece, April 14-20, 2018, Proceedings, Part I (Dirk Beyer, Marieke Huisman, eds.), volume 10805 of Lecture Notes in Computer Science, pages 3–22, 2018, Springer. |
| [292] | Local Soundness for QBF Calculi Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings (Olaf Beyersdorff, Christoph M. Wintersteiger, eds.), volume 10929 of Lecture Notes in Computer Science, pages 217–234, 2018, Springer. |
| [291] | Aligator.jl - A Julia Package for Loop Invariant Generation Intelligent Computer Mathematics - 11th International Conference, CICM 2018, Hagenberg, Austria, August 13-17, 2018, Proceedings (Florian Rabe, William M. Farmer, Grant O. Passmore, Abdou Youssef, eds.), volume 11006 of Lecture Notes in Computer Science, pages 111–117, 2018, Springer. |
| [290] | A Theory of Satisfiability-Preserving Proofs in SAT Solving LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018 (Gilles Barthe, Geoff Sutcliffe, Margus Veanes, eds.), volume 57 of EPiC Series in Computing, pages 583–603, 2018, EasyChair. |
| [289] | Towards Smarter MACE-style Model Finders LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018 (Gilles Barthe, Geoff Sutcliffe, Margus Veanes, eds.), volume 57 of EPiC Series in Computing, pages 454–470, 2018, EasyChair. |
| [288] | Rely-Guarantee Reasoning for Automated Bound Analysis of Lock-Free Algorithms 2018 Formal Methods in Computer Aided Design, FMCAD 2018 (Nikolaj Bjorner, Arie Gurfinkel, eds.), 2018. Note: (to appear) |
| [287] | Parameterized Model Checking of Synchronous Distributed Algorithms by Abstraction Verification, Model Checking, and Abstract Interpretation - 19th International Conference, VMCAI 2018, Los Angeles, CA, USA, January 7-9, 2018, Proceedings (Isil Dillig, Jens Palsberg, eds.), volume 10747 of Lecture Notes in Computer Science, pages 1–24, 2018, Springer. |
| 2017 | |
| [286] | Optimizing Big-Data Queries Using Program Synthesis Proceedings of the 26th Symposium on Operating Systems Principles, pages 631–646, 2017, ACM. |
| [285] | Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints Journal of Automated Reasoning, pages 1–43, 2017. |
| [284] | Synthesis of Distributed Algorithms with Parameterized Threshold Guards OPODIS, volume 95 of LIPIcs, pages 32:1–32:20, 2017. |
| [283] | Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms Verification, Model Checking, and Abstract Interpretation - 18th International Conference, VMCAI 2017, Paris, France, January 15-17, 2017, Proceedings, pages 347–366, 2017. |
| [282] | On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability Information and Computation, volume 252, pages 95–109, 2017. |
| [281] | A short counterexample property for safety and liveness verification of fault-tolerant distributed algorithms Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, January 18-20, 2017, pages 719–734, 2017. Note: A pre-print including the proofs is available at http://arxiv.org/abs/1608.05327 |
| [280] | Para^2: Parameterized Path Reduction, Acceleration, and SMT for Reachability in Threshold-Guarded Distributed Algorithms Formal Methods in System Design, volume 51, number 2, pages 270–307, 2017, Springer. |
| [279] | Dynamic Reductions for Model Checking Concurrent Software Verification, Model Checking and Abstract Interpretation (VMCAI), volume 10145 of Lecture Notes in Computer Science, 2017, Springer. |
| [278] | Automated Invention of Strategies and Term Orderings for Vampire GCAI 2017. 3rd Global Conference on Artificial Intelligence (Christoph Benzm\verb=\="uller, Christine Lisetti, Martin Theobald, eds.), volume 50 of EPiC Series in Computing, pages 121-133, 2017, EasyChair. |
| [277] | Empirical software metrics for benchmarking of verification tools Formal Methods in System Design, volume 50, number 2-3, pages 289–316, 2017. |
| [276] | Testing a Saturation-Based Theorem Prover: Experiences and Challenges Tests and Proofs - 11th International Conference, TAP 2017, Held as Part of STAF 2017, Marburg, Germany, July 19-20, 2017, Proceedings (Sebastian Gabmeyer, Einar Broch Johnsen, eds.), volume 10375 of Lecture Notes in Computer Science, pages 152–161, 2017, Springer. |
| [275] | Set of Support for Theory Reasoning IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017 (Thomas Eiter, David Sands, Geoff Sutcliffe, Andrei Voronkov, eds.), volume 1 of Kalpa Publications in Computing, 2017, EasyChair. |
| [274] | Blocked Clauses in First-Order Logic LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017 (Thomas Eiter, David Sands, eds.), volume 46 of EPiC Series in Computing, pages 31–48, 2017, EasyChair. |
| [273] | Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25-28, 2017 (Michael A. Burr, Chee K. Yap, Mohab Safey El Din, eds.), pages 221–228, 2017, ACM. |
| [272] | A Unifying Principle for Clause Elimination in First-Order Logic Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings (Leonardo de Moura, ed.), volume 10395 of Lecture Notes in Computer Science, pages 274–290, 2017, Springer. |
| [271] | Splitting Proofs for Interpolation Automated Deduction - CADE 26 - 26th International Conference on Automated Deduction, Gothenburg, Sweden, August 6-11, 2017, Proceedings (Leonardo de Moura, ed.), volume 10395 of Lecture Notes in Computer Science, pages 291–309, 2017, Springer. |
| 2016 | |
| [270] | Abstraction and Mining of Traces to Explain Concurrency Bugs Formal Methods in Systems Design (FMSD), volume 49, pages 1–32, October 2016, Springer. |
| [269] | Decidability of Parameterized Verification ACM SIGACT News, volume 47, number 2, pages 53–64, jun 2016. |
| [268] | Vienna Verification Tool: IC3 for Parallel Software TACAS 2016 (Marsha Chechik, Jean-François Raskin, eds.), pages 954–957, 2016, Springer. |
| [267] | Multi-core On-the-fly SCC Decomposition Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 8:1–8:12, 2016, ACM. |
| [266] | Parameterized Systems in BIP: Design and Model Checking 27th International Conference on Concurrency Theory (CONCUR 2016) (Josée Desharnais, Radha Jagadeesan, eds.), volume 59 of Leibniz International Proceedings in Informatics (LIPIcs), pages 30:1–30:16, 2016, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [265] | Tighter Loop Bound Analysis (Technical report) CoRR, volume abs/1605.03636, 2016. |
| [264] | Formal Solutions of Completely Integrable Pfaffian Systems With Normal Crossings Journal of Symbolic Computation, volume to appear, 2016. |
| [263] | A simple and scalable static analysis for bound analysis and amortized complexity analysis Software Engineering 2016, Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Februar 2016, Wien, Österreich, pages 101–102, 2016. |
| [262] | Prompt Alternating-Time Epistemic Logics Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016., pages 258–267, 2016. |
| [261] | Monadic Second Order Finite Satisfiability and Unbounded Tree-Width 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France, pages 13:1–13:20, 2016. |
| [260] | Tighter Loop Bound Analysis Automated Technology for Verification and Analysis - 14th International Symposium, ATVA 2016, Chiba, Japan, October 17-20, 2016, Proceedings, pages 512–527, 2016. |
| [259] | Automatic Verification of Multi-Agent Systems in Parameterised Grid-Environments Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, Singapore, May 9-13, 2016, pages 1190–1199, 2016. |
| [258] | Labelled Interpolation Systems for Hyper-Resolution, Clausal, and Local Proofs Journal of Automated Reasoning, 2016, Springer. |
| [257] | DRAT Proofs for XOR Reasoning Logics in Artificial Intelligence (JELIA), pages 415–429, 2016, Springer. |
| [256] | What You Always Wanted to Know About Model Checking of Fault-Tolerant Distributed Algorithms Perspectives of System Informatics: 10th International Andrei Ershov Informatics Conference, PSI 2015, in Memory of Helmut Veith, Kazan and Innopolis, Russia, August 24-27, 2015, Revised Selected Papers (Manuel Mazzara, Andrei Voronkov, eds.), volume 9609 of LNCS, pages 6–21, 2016, Springer International Publishing. |
| [255] | A Short Counterexample Property for Safety and Liveness Verification of Fault-Tolerant Distributed Algorithms arXiv/CoRR, volume 1608.05327, 2016. Note: (accepted to POPL 2017) |
| [254] | Error Invariants for Concurrent Traces Formal Methods - 21st International Symposium, FM 2016, volume 9995 of Lecture Notes in Computer Science, pages 370-387, 2016, Springer. |
| [253] | Duality in STRIPS planning 8th Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), London, UK, June 13, 2016, Proceedings (J. Benton, Daniel Bryce, Michael Katz, Nir Lipovetzky, Christian Muise, Miquel Ramırez, Alvaro Torralba, eds.), pages 21–27, 2016. |
| [252] | New Techniques in Clausal Form Generation GCAI 2016. 2nd Global Conference on Artificial Intelligence (Christoph Benzm\verb=\="uller, Geoff Sutcliffe, Raul Rojas, eds.), volume 41 of EPiC Series in Computing, pages 11-23, 2016, EasyChair. |
| [251] | A Clausal Normal Form Translation for FOOL GCAI 2016. 2nd Global Conference on Artificial Intelligence (Christoph Benzm\verb=\="uller, Geoff Sutcliffe, Raul Rojas, eds.), volume 41 of EPiC Series in Computing, pages 53-71, 2016, EasyChair. |
| [250] | AVATAR Modulo Theories GCAI 2016. 2nd Global Conference on Artificial Intelligence (Christoph Benzm\verb=\="uller, Geoff Sutcliffe, Raul Rojas, eds.), volume 41 of EPiC Series in Computing, pages 39-52, 2016, EasyChair. |
| [249] | Automated Clustering and Program Repair for Introductory Programming Assignments CoRR, volume abs/1603.03165, 2016. |
| [248] | Feedback generation for performance problems in introductory programming assignments Software Engineering 2016, Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Februar 2016, Wien, Österreich, pages 49–50, 2016. |
| [247] | Empirical software metrics for benchmarking of verification tools Software Engineering 2016, Fachtagung des GI-Fachbereichs Softwaretechnik, 23.-26. Februar 2016, Wien, Österreich, pages 67–68, 2016. |
| [246] | Finding Finite Models in Multi-sorted First-Order Logic Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 323–341, 2016, Springer. |
| [245] | Lifting QBF Resolution Calculi to DQBF Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 490–499, 2016, Springer. |
| [244] | Global Subsumption Revisited (Briefly) Vampire@IJCAR 2016. Proceedings of the 3rd Vampire Workshop, Coimbra, Portugal, July 2, 2016. (Laura Kovács, Andrei Voronkov, eds.), volume 44 of EPiC Series in Computing, pages 61–73, 2016, EasyChair. |
| [243] | Selecting the Selection Automated Reasoning - 8th International Joint Conference, IJCAR 2016, Coimbra, Portugal, June 27 - July 2, 2016, Proceedings (Nicola Olivetti, Ashish Tiwari, eds.), volume 9706 of Lecture Notes in Computer Science, pages 313–329, 2016, Springer. |
| 2015 | |
| [242] | Boolean Satisfiability Solvers and Their Applications in Model Checking Proceedings of the IEEE, volume 103, number 11, pages 1–15, November 2015, IEEE. |
| [241] | Empirical Software Metrics for Benchmarking of Verification Tools Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, pages 561–579, July 2015. |
| [240] | Under-approximating loops in C programs for fast counterexample detection Formal Methods in Systems Design (FMSD), April 2015, Springer. |
| [239] | Time Complexity of Link Reversal Routing ACM Trans. Algorithms, volume 11, number 3, pages 18:1–18:39, jan 2015. |
| [238] | Abstraction and Mining of Traces to Explain Concurrency Bugs Proceedings of the Young Researchers' Conference "Frontiers of Formal Methods", pages 249–253, 2015, RWTH Aachen, Department of Computer Science. Note: technical report/summary version of RV14 paper |
| [237] | Decidability of Parameterized Verification pages 170, 2015. |
| [236] | Extending ALCQIO with Trees 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, July 6-10, 2015, pages 511–522, 2015. |
| [235] | Efficient computation of generalized Ising polynomials on graphs with fixed clique-width Topics in Theoretical Computer Science (TTCS), 2015. |
| [234] | Verification of Asynchronous Mobile-Robots in Partially-Known Environments PRIMA 2015: Principles and Practice of Multi-Agent Systems - 18th International Conference, Bertinoro, Italy, October 26-30, 2015, Proceedings, volume 9387 of Lecture Notes in Computer Science, pages 185–200, 2015, Springer. |
| [233] | On the Expressive Power of Communication Primitives in Parameterised Systems Logic for Programming, Artificial Intelligence, and Reasoning - 20th International Conference, LPAR-20 2015, Suva, Fiji, November 24-28, 2015, Proceedings, volume 9450 of Lecture Notes in Computer Science, pages 313–328, 2015, Springer. |
| [232] | Liveness of Parameterized Timed Networks Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II, volume 9135 of Lecture Notes in Computer Science, pages 375–387, 2015, Springer. |
| [231] | Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings, volume 9139 of Lecture Notes in Computer Science, pages 426–442, 2015, Springer. |
| [230] | Logics of Finite Hankel Rank Chapter in Fields of Logic and Computation II (Lev D. Beklemishev, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, Wolfram Schulte, eds.), volume 9300 of Lecture Notes in Computer Science, pages 237-252, 2015, Springer International Publishing. |
| [229] | Difference Constraints: An adequate Abstraction for Complexity Analysis of Imperative Programs Formal Methods in Computer-Aided Design (FMCAD) (Roope Kaivola, Thomas Wahl, eds.), pages 144-151, 2015, IEEE. |
| [228] | A Combined Toolset for the Verification of Real-Time Distributed Systems Programming and Computer Software, volume 41, number 6, pages 325–335, 2015. |
| [227] | LTSmin: High-Performance Language-Independent Model Checking Chapter in Tools and Algorithms for the Construction and Analysis of Systems (Christel Baier, Cesare Tinelli, eds.), volume 9035 of Lecture Notes in Computer Science, pages 692-707, 2015, Springer Berlin Heidelberg. |
| [226] | SMT and POR beat Counter Abstraction: Parameterized Model Checking of Threshold-Based Distributed Algorithms CAV (Part I), volume 9206 of LNCS, pages 85–102, 2015. |
| [225] | Proving Safety with Trace Automata and Bounded Model Checking Formal Methods - 20th International Symposium, FM 2015, volume 9109 of Lecture Notes in Computer Science, pages 325–341, 2015, Springer. |
| [224] | Closure properties and complexity of rational sets of regular languages Theor. Comput. Sci., volume 605, pages 62–79, 2015. |
| [223] | Loop Patterns in C Programs ECEASST, volume 72, 2015. |
| [222] | Bipartition polynomials, the Ising model and domination in graphs Discussiones Mathematicae Graph Theory, volume 35, number 2, pages 335–353, 2015. |
| [221] | Compilation for Secure Two-Party Computations Software Engineering & Management 2015, Multikonferenz der GI-Fachbereiche Softwaretechnik (SWT) und Wirtschaftsinformatik (WI), FA WI-MAW, 17. März - 20. März 2015, Dresden, Germany (Uwe Aßmann, Birgit Demuth, Thorsten Spitta, Georg Püschel, Ronny Kaiser, eds.), volume 239 of LNI, pages 143–145, 2015, GI. |
| [220] | Perspectives on White-Box Testing: Coverage, Concurrency, and Concolic Execution 8th IEEE International Conference on Software Testing, Verification and Validation, ICST 2015, Graz, Austria, April 13-17, 2015, pages 1–11, 2015, IEEE. |
| 2014 | |
| [219] | On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic Proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014), volume 8635 of Lecture Notes in Computer Science, pages 481-492, August 2014, Springer. |
| [218] | iDQ: Instantiation-Based DQBF Solving Proceedings of the 5th International Workshop on Pragmatics of SAT (POS 2014), aff. to SAT 2014, volume 27 of EPiC Series, pages 103-116, July 2014. |
| [217] | EPR Encodings of Bit-Vector Problems Even With Quantifiers July 2014, Invited talk at the 1st International Workshop on Quantification (QUANTIFY 2014). |
| [216] | Feedback Generation for Performance Problems in Introductory Programming Assignments ArXiv e-prints, volume abs/1403.4064, March 2014. Note: technical report/extended version of FSE14 paper |
| [215] | Parameterized Model Checking of Token-Passing Systems VMCAI 2014, volume 8318 of LNCS, pages 262–281, jan 2014. |
| [214] | On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic 12-13 July 2014, 15th International Workshop on Logic and Computational Complexity and Workshop in Honor of Neil Immerman's 60th Birthday (LCC 2014/ImmermanFest). |
| [213] | First Cycle Games 2014, Highlights of Logic, Games and Automata. |
| [212] | Parameterised Verification of Robot Protocols: An Automata Theoretic Approach 2014, FRIDA Workshop (FLoC 2014). |
| [211] | Explaining the decompositionality of monadic second order logic using applications to combinatorics 2014, Fun With Formal Methods Workshop (FLoC 2014). |
| [210] | Towards a Description Logic for Program Analysis: Extending ALCQIO with Reachability Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014., pages 591–594, 2014. |
| [209] | Shape and Content: Incorporating Domain Knowledge into Shape Analysis Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014., pages 124–127, 2014. |
| [208] | Parameterized Model Checking of Rendezvous Systems 2014, Algorithmics of Infinite State Systems workshop (FLoC 2014). |
| [207] | Parameterized Model Checking of Rendezvous Systems Chapter in CONCUR 2014 – Concurrency Theory (Paolo Baldan, Daniele Gorla, eds.), volume 8704 of Lecture Notes in Computer Science, pages 109-124, 2014, Springer Berlin Heidelberg. |
| [206] | Connection Matrices and the Definability of Graph Parameters Logical Methods in Computer Science, volume 10, number 4, 2014. |
| [205] | Recurrence Relations for Graph Polynomials on Bi-iterative Families of Graphs European Journal of Combinatorics, volume 41, pages 47-67, 2014. Comment: [arXiv] |
| [204] | Silicon Fault Diagnosis Using Sequence Interpolation with Backbones International Conference on Computer-Aided Design (ICCAD), 2014, IEEE/ACM. |
| [203] | Abstraction and Mining of Traces to Explain Concurrency Bugs Runtime Verification Symposium, 2014, Springer Berlin Heidelberg. Note: (Best paper nomination.) |
| [202] | A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis Chapter in Computer Aided Verification - 26th International Conference, CAV 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Vienna, Austria, July 18-22, 2014. Proceedings, pages 745–761, 2014. |
| [201] | Solvability-Based Comparison of Failure Detectors IEEE NCA14, pages 269-276, 2014. |
| [200] | Partial-Order Reduction for Multi-core LTL Model Checking Chapter in Hardware and Software: Verification and Testing (Eran Yahav, ed.), volume 8855 of Lecture Notes in Computer Science, pages 267-283, 2014, Springer International Publishing. |
| [199] | Guard-based partial-order reduction International Journal on Software Tools for Technology Transfer, pages 1-22, 2014, Springer Berlin Heidelberg. |
| [198] | A Representation Theorem for (q-)Holonomic Sequences Journal of Computer System Sciences, volume 80, pages 363-374, 2014. Comment: [pdf] |
| [197] | How to Make a Simple Tool for Verification of Real-Time Systems Automatic Control and Computer Sciences, volume 48, number 7, pages 534–542, 2014, Allerton Press. |
| [196] | On the Completeness of Bounded Model Checking for Threshold-Based Distributed Algorithms: Reachability Chapter in CONCUR 2014 — Concurrency Theory (Paolo Baldan, Daniele Gorla, eds.), volume 8704 of Lecture Notes in Computer Science, pages 125-140, 2014. |
| [195] | Feedback Generation for Performance Problems in Introductory Programming Assignments Proceedings of the 22Nd ACM SIGSOFT International Symposium on Foundations of Software Engineering, pages 41–51, 2014, ACM. |
| [194] | Incremental Bounded Software Model Checking SPIN, pages 40–47, 2014, ACM. |
| [193] | Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms Formal Methods for Executable Software Models, pages 122–171, 2014, Springer. |
| [192] | CBMC-GC: An ANSI C Compiler for Secure Two-Party Computations Compiler Construction - 23rd International Conference, CC 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings (Albert Cohen, ed.), volume 8409 of Lecture Notes in Computer Science, pages 244–249, 2014, Springer. |
| [191] | Concolic Testing of Concurrent Programs 2014, CAV Workshop (EC)\^2. |
| [190] | A Logic-based Framework for Verifying Consensus Algorithms VMCAI, volume 8318 of LNCS, pages 161–181, 2014. |
| [189] | Concolic Testing of Concurrent Programs Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar - 28. Februar 2014, Kiel, Deutschland, pages 101–102, 2014. |
| [188] | Reusing Information in Multi-Goal Reachability Analyses Software Engineering 2014, Fachtagung des GI-Fachbereichs Softwaretechnik, 25. Februar - 28. Februar 2014, Kiel, Deutschland, pages 97–98, 2014. |
| [187] | Size-Change Abstraction and Max-Plus Automata Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I, pages 208–219, 2014. |
| [186] | Shape and Content - A Database-Theoretic Perspective on the Analysis of Data Structures Integrated Formal Methods - 11th International Conference, IFM 2014, Bertinoro, Italy, September 9-11, 2014, Proceedings, pages 3–17, 2014. |
| [185] | An Open Alternative for SMT-Based Verification of Scade Models Formal Methods for Industrial Critical Systems - 19th International Conference, FMICS 2014, Florence, Italy, September 11-12, 2014. Proceedings, pages 124–139, 2014. |
| [184] | Reduction of Resolution Refutations and Interpolants via Subsumption Chapter in Hardware and Software: Verification and Testing (Eran Yahav, ed.), volume 8855 of Lecture Notes in Computer Science, pages 188-203, 2014, Springer International Publishing. |
| [183] | Counterexample to Induction-Guided Abstraction-Refinement (CTIGAR) Computer Aided Verification, volume 8559 of Lecture Notes in Computer Science, pages 829–846, 2014, Springer Berlin Heidelberg. |
| [182] | Cycle Games SR2014, 2014. |
| 2013 | |
| [181] | On the Concept of Variable Roles and its Use in Software Analysis ArXiv e-prints, volume abs/1305.6745, May 2013. |
| [180] | Mining Sequential Patterns to Explain Concurrent Counterexamples SPIN, volume 7976 of LNCS, pages 264–281, 2013. |
| [179] | Challenges in Compiler Construction for Secure Two-Party Computation (Martin Franz, Andreas Holzer, Rupak Majumdar, Bryan Parno, Helmut Veith, eds.), pages 3–6, 2013, ACM. |
| [178] | Ramsey vs. Lexicographic Termination Proving TACAS, pages 47-61, 2013. |
| [177] | Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141) Dagstuhl Reports (Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, Josef Widder, eds.), volume 3, number 4, pages 1–16, 2013, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. |
| [176] | Advanced SAT Techniques for Abstract Argumentation Chapter in Computational Logic in Multi-Agent Systems (João Leite, Tran Cao Son, Paolo Torroni, Leon Torre, Stefan Woltran, eds.), volume 8143 of Lecture Notes in Computer Science, pages 138-154, 2013, Springer Berlin Heidelberg. |
| [175] | Under-Approximating Loops in C Programs for Fast Counterexample Detection Chapter in Computer Aided Verification (Natasha Sharygina, Helmut Veith, eds.), volume 8044 of Lecture Notes in Computer Science, pages 381-396, 2013, Springer Berlin Heidelberg. |
| [174] | Parameterized model checking of fault-tolerant distributed algorithms by abstraction FMCAD, pages 201–209, 2013. |
| [173] | Towards Modeling and Model Checking Fault-Tolerant Distributed Algorithms SPIN, volume 7976 of LNCS, pages 209–226, 2013. |
| [172] | On the Structure and Complexity of Rational Sets of Regular Languages IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India (Anil Seth, Nisheeth K. Vishnoi, eds.), volume 24 of LIPIcs, pages 377-388, 2013, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
| [171] | An experience on using simulation environment DYANA augmented with UPPAAL for verification of embedded systems defined by UML statecharts 2013, CAV Workshop VES13. |
| [170] | PETShop'13, Proceedings of the 2013 ACM Workshop on Language Support for Privacy-Enhancing Technologies, Co-located with CCS 2013, November 4, 2013, Berlin, Germany (Martin Franz, Andreas Holzer, Rupak Majumdar, Bryan Parno, Helmut Veith, eds.), 2013, ACM. |
| [169] | On the Concept of Variable Roles and its Use in Software Analysis FMCAD, pages 226–229, 2013. |
| [168] | On the Structure and Complexity of Rational Sets of Regular Languages CoRR, volume abs/1305.6074, 2013. |
| [167] | Solving Constraints for Generational Search Tests and Proofs - 7th International Conference, TAP 2013, Budapest, Hungary, June 16-20, 2013. Proceedings (Margus Veanes, Luca Viganò, eds.), volume 7942 of Lecture Notes in Computer Science, pages 197-213, 2013, Springer. |
| [166] | Con2colic testing Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering, ESEC/FSE'13, Saint Petersburg, Russian Federation, August 18-26, 2013 (Bertrand Meyer, Luciano Baresi, Mira Mezini, eds.), pages 37-47, 2013, ACM. |
| [165] | Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction PODC, pages 119–121, 2013. |
| [164] | Information Reuse for Multi-goal Reachability Analyses ESOP, pages 472–491, 2013. |
| [163] | The first workshop on language support for privacy-enhancing technologies (PETShop'13) ACM Conference on Computer and Communications Security (Ahmad-Reza Sadeghi, Virgil D. Gligor, Moti Yung, eds.), pages 1485–1486, 2013, ACM. |
| [162] | PETShop'13, Proceedings of the 2013 ACM Workshop on Language Support for Privacy-Enhancing Technologies, Co-located with CCS 2013, November 4, 2013, Berlin, Germany (Martin Franz, Andreas Holzer, Rupak Majumdar, Bryan Parno, Helmut Veith, eds.), 2013, ACM. |
| [161] | Verification across Intellectual Property Boundaries ACM Trans. Softw. Eng. Methodol., volume 22, number 2, pages 15, 2013. |
| [160] | Link Reversal Routing with Binary Link Labels: Work Complexity SIAM Journal on Computing, volume 42, number 2, pages 634–661, 2013. |
| [159] | Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings (Natasha Sharygina, Helmut Veith, eds.), volume 8044 of Lecture Notes in Computer Science, 2013, Springer. |
| [158] | Cube-and-Conquer Approach for SAT Solving on Grids Annales Mathematicae et Informaticae, volume 42, pages 9-21, 2013. |
| 2012 | |
| [157] | Vinter: A Vampire-Based Tool for Interpolation APLAS, December 2012, Springer. |
| [156] | Wait-Free Stabilizing Dining Using Regular Registers OPODIS, volume 7702 of LNCS, pages 284–299, December 2012, Springer. |
| [155] | Coverage-based Trace Signal Selection for Fault Localisation in Post-Silicon Validation Haifa Verification Conference (HVC) (Armin Biere, Tanja E. J. Vos, Amir Nahir, eds.), November 2012, Springer. |
| [154] | Starting a Dialog between Model Checking and Fault-tolerant Distributed Algorithms ArXiv e-prints, October 2012. |
| [153] | Counter Attack on Byzantine Generals: Parameterized Model Checking of Fault-tolerant Distributed Algorithms ArXiv e-prints, October 2012. |
| [152] | Interpolant Strength Revisited Theory and Applications of Satisfiability Testing (SAT) (Alessandro Cimatti, Roberto Sebastiani, eds.), volume 7317 of Lecture Notes in Computer Science, pages 312-326, 2012, Springer. |
| [151] | Parallel Assertions for Architectures with Weak Memory Models Automated Technology for Verification and Analysis (ATVA) (Supratik Chakraborty, Madhavan Mukund, eds.), pages 254-268, 2012, Springer. |
| [150] | Consensus in the presence of mortal Byzantine faulty processes Distributed Computing, volume 24, number 6, pages 299–321, 2012. |
| [149] | Special Issue: Games in Verification J. Comput. Syst. Sci., volume 78, number 2, pages 393, 2012. |
| [148] | Interpretations in Trees with Countably Many Branches LICS, pages 551–560, 2012. |
| [147] | Who is afraid of Model Checking Distributed Algorithms? 2012, CAV Workshop (EC)\^2. |
| [146] | A Myhill-Nerode theorem for automata with advice GandALF, pages 238–246, 2012. |
| [145] | Parameterized Model Checking by Network Invariants: the Asynchronous Case 2012, LICS Workshop AISS. |
| [144] | Efficient Checking of Link-Reversal-Based Concurrent Systems CONCUR, volume 7454 of LNCS, pages 486–499, 2012. |
| [143] | Selected Papers of the Conference "Computer Science Logic CSL 2010": Preface Logical Methods in Computer Science, 2012. |
| [142] | Proving Reachability Using FShell - (Competition Contribution) TACAS, volume 7214 of Lecture Notes in Computer Science, pages 538–541, 2012, Springer. |
| [141] | Bounded-Interference Sequentialization for Testing Concurrent Programs ISoLA (1), volume 7609 of LNCS, pages 372–387, 2012. |
| [140] | Secure Two-party Computations in ANSI C ACM Conference on Computer and Communications Security, pages 772–783, 2012. |
| 2011 | |
| [139] | An Introduction to Test Specification in FQL Proceedings of 6th International Haifa Verification Conference (HVC 2011) (Sharon Barner, Ian G. Harris, Daniel Kroening, Orna Raz, eds.), volume 6504 of Lecture Notes in Computer Science, pages 9-22, October 2011, Springer. |
| [138] | Seamless Testing for Models and Code Proceedings of 14th International Conference on Fundamental Approaches to Software Engineering (FASE 2011), volume 6603 of Lecture Notes in Computer Science, pages 278-293, April 2011, Springer. |
| [137] | Improving the Confidence in Measurement-Based Timing Analysis 2011 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2011, March 2011, IEEE Computer Society. Note: To appear. |
| [136] | Bound analysis of imperative programs with the size-change abstraction Proceedings of the 18th international conference on Static analysis, pages 280–297, 2011, Springer-Verlag. |
| 2010 | |
| [135] | Seamless Model-driven Development put into Practice Proceedings of 4th International Symposium on Leveraging Applications (ISoLA 2010) (Tiziana Margaria, Bernhard Steffen, eds.), volume 6415 of Lecture Notes in Computer Science, pages 18-32, October 2010, Springer. |
| [134] | Precise Static Analysis of Untrusted Driver Binaries Proceedings of the 10th International Conference on Formal Methods in Computer-Aided Design (FMCAD 2010) (Roderick Bloem, Natasha Sharygina, eds.), pages 43-50, October 2010. |
| [133] | Timely Time Estimates Proceedings of 4th International Symposium on Leveraging Applications (ISoLA 2010) (Tiziana Margaria, Bernhard Steffen, eds.), volume 6415 of Lecture Notes in Computer Science, pages 33-46, October 2010, Springer. |
| [132] | How did you specify your test suite ? Proceedings of the 25th IEEE/ACM International Conference on Automated Software Engineering (ASE 2010), pages 407–416, September 2010, ACM. |
| [131] | Model-Based Generation of Fault-Tolerant Embedded Systems Proceedings of the 2010 International Conference on Embedded Systems and Applications, ESA 2010 (Hamid R. Arabnia, Ashu M. G. Solo, eds.), pages 136–142, July 2010, CSREA Press. |
| [130] | Proving Memory Safety of Floating-Point Computations by Combining Static and Dynamic Program Analysis International Symposium on Software Testing and Analysis (ISSTA'10), pages 1-12, July 2010, ACM. |
| [129] | On the Distributivity of LTL Specifications ACM Transactions on Computational Logic (TOCL), volume 11, number 3, May 2010, ACM. |
| [128] | Constraint Satisfaction with Bounded Treewidth Revisited Journal of Computer and System Sciences (JCSS), volume 76, number 2, pages 103-114, March 2010, Academic Press. |
| [127] | Algorithms for Propositional Model Counting Journal of Discrete Algorithms (JDA), volume 8, number 1, pages 50-64, March 2010, Elsevier. |
| [126] | Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers International Journal on Software Tools for Technology Transfer, volume 12, number 1, pages 23–37, February 2010. |
| [125] | Proactive Detection of Computer Worms Using Model Checking IEEE Transactions on Dependable and Secure Computing, volume 7, number 4, pages 424-438, October-December 2010. |
| [124] | Loopus - A Tool for Computing Loop Bounds for C Programs Proceedings of the 3rd Workshop on Invariant Generation (WING), 2010. |
| [123] | Semantic Integrity in Large-Scale Online Simulations ACM Transactions on Internet Technology (TOIT), 2010. Note: accepted for publication |
| [122] | The reachability-bound problem PLDI, pages 292-304, 2010. |
| [121] | Runtime Verification for LTL and TLTL ACM Transactions on Software and Methodology (TOSEM), 2010. Note: accepted for publication |
| [120] | Comparing LTL Semantics for Runtime Verification Journal of Logic and Computation (JLC), 2010. Note: accepted for publication |
| 2009 | |
| [119] | An Application of Data Mining to Identify Data Quality Problems Proceedings of the Third International Conference on Advanced Engineering Computing and Applications in Sciences, ADVCOMP 2009, October 2009, IEEE Computer Society. |
| [118] | Slope Testing for Activity Diagrams and Safety Critical Software October 2009, Technical report, Technische Universität Darmstadt. |
| [117] | A Precise Specification Framework for White Box Program Testing September 2009, Technical report, Technische Universität Darmstadt. |
| [116] | Encoding Treewidth into SAT Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing (SAT'09) (Oliver Kullmann, ed.), volume 5584 of Lecture Notes in Computer Science, pages 45–50, July 2009, Springer-Verlag. |
| [115] | Short Regular Expressions from Finite Automata: Empirical Results Proceedings of the 14th International Conference on Implementation and Application of Automata (CIAA 2009), volume 5642 of Lecture Notes in Computer Science, pages 188–197, July 2009, Springer. |
| [114] | Model Analysis via a Translation Schema to Coloured Petri Nets Proceedings of the International Workshop on Petri Nets and Software Engineering, PNSE '09 (D. Moldt, ed.), pages 273-292, June 2009. |
| [113] | Generating Distributed Code From COLA Models Chapter in 20, volume 33 of Lecture Notes in Electrical Engineering, March 2009, Springer. |
| [112] | Performance Modelling for Avionics Systems 12th International Conference on Computer Aided Systems Theory - EUROCAST 2009, volume 5717 of Lecture Notes in Computer Science, pages 833-840, February 2009, Springer. |
| [111] | Fixed-Parameter Tractability Chapter in Handbook of Satisfiability (A. Biere, M. Heule, H. van Maaren, T. Walsh, eds.), volume 185 of Frontiers in Artificial Intelligence and Applications, pages 425–454, February 2009, IOS Press. |
| [110] | Backdoor Sets of Quantified Boolean Formulas Journal of Automated Reasoning (JAR), volume 42, number 1, pages 77–97, January 2009. |
| [109] | An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries Proceedings of the Tenth International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2009) (Neil D. Jones, Markus Müller-Olm, eds.), volume 5403 of Lecture Notes in Computer Science, January 2009, Springer. |
| [108] | Query-Driven Program Testing Proceedings of the Tenth International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2009) (Neil D. Jones, Markus Müller-Olm, eds.), volume 5403 of Lecture Notes in Computer Science, pages 151–166, January 2009, Springer. |
| [107] | A Brief Account of Runtime Verification Journal of Logic and Algebraic Programming (JLAP), number 78, pages 293-303, 2009. |
| [106] | Towards Resource Consumption-Aware Programming , volume 0, pages 490-493, 2009, IEEE Computer Society. |
| [105] | Reliable Operating Modes for Distributed Embedded Systems Proceedings of the 6th International Workshop on Model-based Methodologies for Pervasive and Embedded Software, 2009, IEEE Computer Society. |
| [104] | One Click from Model to Reality Proceedings of Symposium on Automotive/Avionics Systems Engineering (SAASE 2009), 2009. |
| [103] | Dependency Coverage Criteria with FQL 2009, Technical report, Technische Universität Darmstadt. |
| [102] | Tractable Cases of the Extended Global Cardinality Constraint Constraints, 2009, Springer Netherlands. Note: In press. |
| 2008 | |
| [101] | Query-Driven Program Testing October 2008, Technical report, Technische Universität Darmstadt. |
| [100] | Navigating the Requirements Jungle Leveraging Applications of Formal Methods, Verification and Validation (Tiziana Margaria, Bernhard Steffen, eds.), volume 17 of Communications in Computer and Information Science, pages 354–368, October 2008, Springer. |
| [99] | Optimizing Automatic Deployment Using Non-Functional Requirement Annotations Leveraging Applications of Formal Methods, Verification and Validation (Tiziana Margaria, Bernhard Steffen, eds.), volume 17 of Communications in Computer and Information Science, pages 400–414, October 2008, Springer. |
| [98] | A Model Driven Development Approach for Implementing Reactive Systems in Hardware Forum on Specification and Design Languages (FDL08), pages 197–202, September 2008, IEEE Computer Society. |
| [97] | From COLA Models to Distributed Embedded Systems Code IAENG International Journal of Computer Science, volume 35, number 3, pages 427–437, September 2008. |
| [96] | FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement Proceedings of the 20th International Conference on Computer Aided Verification (CAV 2008), volume 5123 of Lecture Notes in Computer Science, pages 209–213, July 2008, Springer. |
| [95] | Mapping Data-Flow Dependencies onto Distributed Embedded Systems Proceedings of the 2008 International Conference on Software Engineering Research & Practice, SERP 2008, July 2008. |
| [94] | Jakstab: A Static Analysis Platform for Binaries Proceedings of the 20th International Conference on Computer Aided Verification (CAV 2008), volume 5123 of Lecture Notes in Computer Science, July 2008, Springer. |
| [93] | Domain Pattern Abstraction + Ptolemaic Abstract Domains = Environment Abstraction for Concurrent Systems Exploiting Concurrency Efficiently and Correctly – (EC)__MATH0__, July 2008. |
| [92] | Automatic Generation of SystemC Models from Component-based Designs for Early Design Validation and Performance Analysis WOSP '08: Proceedings of the 7th International Workshop on Software and Performance, pages 139–144, June 2008, ACM. |
| [91] | Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems Tools and Algorithms for the Construction and Analysis of Systems, 14th International Conference, TACAS 2008, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2008, Budapest, Hungary, March 29-April 6, 2008 (C. R. Ramakrishnan, Jakob Rehof, eds.), volume 4963 of Lecture Notes in Computer Science, pages 33–47, April 2008, Springer. |
| [90] | A Benchmarking Suite for Measurement-Based WCET Analysis Tools International Conference on Software Testing Verification and Validation Workshop (ICSTW'08), pages 353–356, April 2008, IEEE Computer Society Press. |
| [89] | Running COLA on Embedded Systems Proceedings of The International MultiConference of Engineers and Computer Scientists 2008, pages 922–928, March 2008. |
| [88] | The good, the bad, the ugly—but how ugly is ugly? February 2008, Technical report, Institut für Informatik, Technische Universität München. |
| [87] | Towards Improvements in Design and Analysis of Embedded Systems (Abstract) Proceedings of the 3rd Annual Meeting of Institute Alb-Shkenca, 1 - 3 September 2008. |
| [86] | Impartial Anticipation in Runtime-Verification Automated Technology for Verification and Analysis (ATVA'08), volume 5311 of Lecture Notes in Computer Science (LNCS), pages 386–396, 2008. |
| [85] | Variable Dependencies of Quantified CSPs Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'08), volume 5330 of Lecture Notes in Computer Science, pages 512–527, 2008, Springer-Verlag. |
| [84] | 25 Years of Model Checking - History, Achievements, Perspectives (Orna Grumberg, Helmut Veith, eds.), volume 5000 of Lecture Notes in Computer Science, 2008, Springer. |
| [83] | Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings (Iliano Cervesato, Helmut Veith, Andrei Voronkov, eds.), volume 5330 of Lecture Notes in Computer Science, 2008, Springer. |
| 2007 | |
| [82] | Don't care in SMT—Building flexible yet efficient abstraction/refinement solvers Proceedings of the 2007 ISoLA Workshop On Leveraging Applications of Formal Methods, Verification and Validation (ISoLA), pages 135–146, December 2007. |
| [81] | Software Transformations to Improve Malware Detection Journal in Computer Virology, volume 3, number 4, pages 253–265, November 2007. |
| [80] | CPNunf: A tool for McMillan's Unfolding of Coloured Petri Nets Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools (Kurt Jensen, ed.), October 2007. |
| [79] | COLA – The component language September 2007, Technical report, Institut für Informatik, Technische Universität München. |
| [78] | Compatibility and reuse in component-based systems via type and unit inference Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (SEAA), pages 101–108, August 2007, IEEE Computer Society Press. |
| [77] | Compatibility and reuse in component-based systems via type and unit inference May 2007, Technical report, Institut für Informatik, Technische Universität München. |
| [76] | Tool-support for the analysis of hybrid systems and models Proceedings of the 2007 Conference on Design, Automation and Test in Europe (DATE), pages 924–929, April 2007, European Design and Automation Association. |
| [75] | Architecture and Security in Networked Virtual Environments 2007, PhD thesis, Vienna University of Technology. |
| [74] | Enforcing Semantic Integrity on Untrusted Clients in Networked Virtual Environments (Extended Abstract) IEEE Security and Privacy (S&P'07), pages 179–186, 2007. |
| [73] | Verification Across Intellectual Property Boundaries Computer Aided Verification (CAV'07), pages 82–94, 2007. |
| [72] | Runtime Verfication for LTL and TLTL 2007, Technical report, Institut für Informatik, Technische Universität München. |
| [71] | The good, the bad, and the ugly, but how ugly is ugly? Workshop on Runtime Verification (RV'07), pages 126–138, 2007. |
| [70] | Using Verification Technology to Specify and Detect Malware 11th International Conference on Computer Aided Systems Theory (EUROCAST 2007), volume 4739 of Lecture Notes in Computer Science, pages 497–504, 2007, Springer. |
| 2006 | |
| [69] | Development of a tool to solve mixed logical/linear constraint problems February 2006, Master's thesis, Technische Universität München. |
| [68] | Runtime Reflection: Dynamic model-based analyis of component-based distributed embedded systems Modellierung von Automotive Systems, 2006. |
| [67] | Monitoring of Realtime Properties Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), pages 260–272, 2006. |
| [66] | Model-Based Runtime Analysis of Distributed Reactive Systems Australian Software Engineering Conference (ASWEC'06), pages 243–252, 2006. |
| [65] | The first order definability of graphs: Upper bounds for quantifier depth Discrete Applied Mathematics, volume 154, number 17, pages 2511–2529, 2006. |
| [64] | Environment Abstraction for Parameterized Verification Verification, Model Checking, and Abstract Interpretation, 7th International Conference, VMCAI 2006, Charleston, SC, USA, January 8-10, 2006, Proceedings (E. Allen Emerson, Kedar S. Namjoshi, eds.), pages 126–141, 2006, Springer. |
| [63] | From Temporal Logic Queries to Vacuity Detection Verification of Infinite-State Systems with Applications to Security, Proceedings of the NATO Advanced Research Workshop "Verification of Infinite State Systems with Applications to Security VISSAS 2005", Timisoara, Romania, March 17-22, 2005 (Edmund M. Clarke, Marius Minea, Ferucio Laurentiu Tiplea, eds.), volume 1 of NATO Security through Science Series D: Information and Communication Security, pages 149–167, 2006, IOS Press. |
| 2005 | |
| [62] | Malware Normalization November 2005, Technical report, University of Wisconsin, Madison. |
| [61] | Model Checking: Back and Forth between Hardware and Software Verified Software: Theories, Tools, Experiments, October 2005. |
| [60] | Detecting Malicious Code by Model Checking GI SIG SIDAR Conference on Detection of Intrusions and Malware & Vulnerability Assessment (DIMVA'05) (Klaus Julisch, Christopher Krügel, eds.), volume 3548 of Lecture Notes in Computer Science, pages 174–187, July 2005, Springer. |
| [59] | Approximating Succinct MaxSat Journal of Logic and Computation (JLC), volume 15, number 4, pages 551–557, 2005. |
| [58] | A Novel SAT Procedure for Linear Real Arithmetic Third Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR 2005), 2005. |
| [57] | Model-Based Testing of Reactive Systems Chapter in Tools for Test Case Generation, volume 3472 of Lecture Notes in Computer Science, pages 391–438, 2005, Springer. |
| [56] | Runtime verification revisited 2005, Technical report, Technische Universität München. |
| [55] | An Iterative Framework for Simulation Conformance J. Log. Comput., volume 15, number 4, pages 465–488, 2005. |
| [54] | Deterministic CTL Query Solving 12th International Symposium on Temporal Representation and Reasoning (TIME 2005), 23-25 June 2005, Burlington, Vermont, USA, pages 156–165, 2005, IEEE Computer Society. |
| [53] | Malware Engineering Sicherheit 2005: Sicherheit - Schutz und Zuverlässigkeit, Beiträge der 2. Jahrestagung des Fachbereichs Sicherheit der Gesellschaft für Informatik e.v. (GI), 5.-8. April 2005 in Regensburg (Hannes Federrath, ed.), pages 139–148, 2005, GI. |
| [52] | Ensuring Media Integrity on Third-Party Infrastructures Security and Privacy in the Age of Ubiquitous Computing, IFIP TC11 20th International Conference on Information Security (SEC 2005), May 30 - June 1, 2005, Chiba, Japan (Ryôichi Sasaki, Sihan Qing, Eiji Okamoto, Hiroshi Yoshiura, eds.), pages 493–508, 2005, Springer. |
| [51] | State/Event Software Verification for Branching-Time Specifications Integrated Formal Methods, 5th International Conference, IFM 2005, Eindhoven, The Netherlands, November 29 - December 2, 2005, Proceedings (Judi Romijn, Graeme Smith, Jaco van de Pol, eds.), pages 53–69, 2005, Springer. |
| [50] | Temporal Logic Model Checking Chapter in Handbook of Networked and Embedded Control Systems (Dimitrios Hristu-Varsakelis, William S. Levine, eds.), pages 539–558, 2005, Birkhäuser. |
| 2004 | |
| [49] | Towards a formal semantics for ODRL First ODRL International Workshop, pages 137–148, 2004. |
| [48] | Modular Verification of Software Components in C IEEE Trans. Software Eng., volume 30, number 6, pages 388–402, 2004. |
| [47] | A Syntactic Characterization of Distributive LTL Queries Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings (Josep Díaz, Juhani Karhumäki, Arto Lepistö, Donald Sannella, eds.), pages 1099–1110, 2004, Springer. |
| [46] | Parameterized Vacuity Formal Methods in Computer-Aided Design, 5th International Confrence, FMCAD 2004, Austin, Texas, USA, November 15-17, 2004, Proceedings (Alan J. Hu, Andrew K. Martin, eds.), pages 322–336, 2004, Springer. |
| [45] | Verification by Network Decomposition CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 - September 3, 2004, Proceedings (Philippa Gardner, Nobuko Yoshida, eds.), pages 276–291, 2004, Springer. |
| 2003 | |
| [44] | Transaction Processing for Clustered Virtual Environments NATO Advanced Research Workshop on Concurrent Information Processing and Computing, pages 146–158, July 2003. |
| [43] | The ATOM Middleware for Massively Parallel Multi-Player Online Games March 2003, Technical report, Vienna University of Technology, Database and Artificial Intelligence Group. |
| [42] | Counterexample-guided abstraction refinement for symbolic model checking J. ACM, volume 50, number 5, pages 752–794, 2003. |
| [41] | Integrating Publish/Subscribe into a Mobile Teamwork Support Platform Proceedings of the Fifteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2003), Hotel Sofitel, San Francisco Bay, CA, USA, July 1-3, 2003, pages 510–517, 2003. |
| [40] | SAT Based Predicate Abstraction for Hardware Verification Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers (Enrico Giunchiglia, Armando Tacchella, eds.), pages 78–92, 2003, Springer. |
| [39] | Modular Verification of Software Components in C Proceedings of the 25th International Conference on Software Engineering, May 3-10, 2003, Portland, Oregon, USA, pages 385–395, 2003, IEEE Computer Society. |
| [38] | Watermarking schemes provably secure against copy and ambiguity attacks Proceedings of the 2003 ACM workshop on Digital rights management 2003, Washington, DC, USA, October 27, 2003 (Moti Yung, ed.), pages 111–119, 2003, ACM. |
| [37] | Friends or Foes? Communities in Software Verification (Invited Lecture) Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Güdel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings (Matthias Baaz, Johann A. Makowsky, eds.), pages 528–529, 2003, Springer. |
| [36] | Validity of CTL Queries Revisited Computer Science Logic, 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Güdel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings (Matthias Baaz, Johann A. Makowsky, eds.), pages 470–483, 2003, Springer. |
| [35] | Counterexamples Revisited: Principles, Algorithms, Applications Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday (Nachum Dershowitz, ed.), pages 208–224, 2003, Springer. |
| 2002 | |
| [34] | Securing Symmetric Watermarking Schemes Against Protocol Attacks Security and Watermarking of Multimedia Contents IV, volume 4675 of SPIE, pages 260–268, 2002. |
| [33] | Datalog LITE: a deductive query language with linear time model checking ACM Trans. Comput. Log., volume 3, number 1, pages 42–79, 2002. |
| [32] | On the complexity of data disjunctions Theor. Comput. Sci., volume 288, number 1, pages 101–128, 2002. |
| [31] | Tree-Like Counterexamples in Model Checking 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings, pages 19–29, 2002, IEEE Computer Society. |
| [30] | Automated Abstraction Refinement for Model Checking Large State Spaces Using SAT Based Conflict Analysis Formal Methods in Computer-Aided Design, 4th International Conference, FMCAD 2002, Portland, OR, USA, November 6-8, 2002, Proceedings (Mark Aagaard, John W. O'Leary, eds.), pages 33–51, 2002, Springer. |
| 2001 | |
| [29] | A Guide to Quantified Propositional Gödel Logic Workshop on Theory and Applications of Quantified Boolean Formulas (QBF 2001), 2001. |
| [28] | Complexity of t-tautologies Ann. Pure Appl. Logic, volume 113, number 1-3, pages 3–11, 2001. |
| [27] | Efficient Filtering in Publish-Subscribe Systems Using Binary Decision Diagrams Proceedings of the 23rd International Conference on Software Engineering, ICSE 2001, 12-19 May 2001, Toronto, Ontario, Canada, pages 443–452, 2001, IEEE Computer Society. |
| [26] | Non-linear Quantification Scheduling in Image Computation ICCAD, pages 293–, 2001. |
| [25] | Progress on the State Explosion Problem in Model Checking Informatics - 10 Years Back. 10 Years Ahead. (Reinhard Wilhelm, ed.), pages 176–194, 2001, Springer. |
| [24] | Using Combinatorial Optimization Methods for Quantification Scheduling Correct Hardware Design and Verification Methods, 11th IFIP WG 10.5 Advanced Research Working Conference, CHARME 2001, Livingston, Scotland, UK, September 4-7, 2001, Proceedings (Tiziana Margaria, Thomas F. Melham, eds.), pages 293–309, 2001, Springer. |
| 2000 | |
| [23] | Application of Approximation Theory to Succinct Data Representation 2000, Master's thesis, Vienna University of Technology. |
| [22] | An Analytic Calculus for Quantified Propositional Gödel Logic Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2000, St Andrews, Scotland, UK, July 3-7, 2000, Proceedings (Roy Dyckhoff, ed.), pages 112–126, 2000, Springer. |
| [21] | Executable Protocol Specification in ESL Formal Methods in Computer-Aided Design, Third International Conference, FMCAD 2000, Austin, Texas, USA, November 1-3, 2000, Proceedings (Warren A. Hunt Jr., Steven D. Johnson, eds.), pages 197–216, 2000, Springer. |
| [20] | Counterexample-Guided Abstraction Refinement Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings (E. Allen Emerson, A. Prasad Sistla, eds.), pages 154–169, 2000, Springer. |
| [19] | An axiomatization of quantified proposition Gödel logic using the Takeuti-Titani rule Logic Colloquium 1998, volume 13 of Lecture Notes in Logic, pages 91–104, 2000, Association for Symbolic Logic. |
| [18] | Linear time datalog and branching time logic , pages 443–467, 2000, Kluwer Academic Publishers. |
| 1999 | |
| [17] | Multiprocessor Scheduling using the DÉJÀ VU Scheduling Class Library ÖGAI (Journal of the Austrian Society for AI), volume 4, pages 16–25, 1999. |
| [16] | Succinctness as a Source of Complexity in Logical Formalisms Ann. Pure Appl. Logic, volume 97, number 1-3, pages 231–260, 1999. |
| [15] | On the Undecidability of some Sub-Classical First-Order Logics Foundations of Software Technology and Theoretical Computer Science, 19th Conference, Chennai, India, December 13-15, 1999, Proceedings (C. Pandu Rangan, Venkatesh Raman, R. Ramanujam, eds.), pages 258–268, 1999, Springer. |
| [14] | Interpolation in Fuzzy Logic Archive for Mathematical Logic, volume 38, pages 461–489, 1999. |
| 1998 | |
| [13] | Eine allgemeine Methode zur Bestimmung der Ausdruckskomplexität von Query Languages GI Workshop Grundlagen von Datenbanken, volume 63 of Konstanzer Schriften in Mathematik und Informatik, May 1998. |
| [12] | John W. Dawson, Jr., Logical Dilemmas: The Life and Work of Kurt Gödel Chapter in (Werner Leinfellner, Eckehart Köhler, eds.), 1998, Springer. |
| [11] | Succinct Representation, Leaf Languages, and Projection Reductions Inf. Comput., volume 142, number 2, pages 207–236, 1998. |
| [10] | Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings (Lubos Brim, Jozef Gruska, Jirí Zlatuska, eds.), pages 203–212, 1998, Springer. |
| [9] | A General Method to Determine the Expression Complexity of Database Query Languages Grundlagen von Datenbanken, pages 134–137, 1998. |
| [8] | Quantifier Elimination in Fuzzy Logic Computer Science Logic, 12th International Workshop, CSL '98, Annual Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998, Proceedings (Georg Gottlob, Etienne Grandjean, Katrin Seyr, eds.), pages 399–414, 1998, Springer. |
| [7] | How to Encode a Logical Structure by an OBDD IEEE Conference on Computational Complexity, pages 122–131, 1998. |
| 1997 | |
| [6] | Languages Represented by Boolean Formulas Inf. Process. Lett., volume 63, number 5, pages 251–256, 1997. |
| [5] | Modular Logic Programming and Generalized Quantifiers Logic Programming and Nonmonotonic Reasoning, 4th International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings (Jürgen Dix, Ulrich Furbach, Anil Nerode, eds.), pages 290–309, 1997, Springer. |
| [4] | Generalized Quantifiers in Logic Programs Generalized Quantifiers and Computation, 9th European Summer School in Logic, Language, and Information, ESSLLI'97 Workshop, Aix-en-Provence, France, August 11-22, 1997, Revised Lectures (Jouko A. Väänänen, ed.), pages 72–98, 1997, Springer. |
| 1996 | |
| [3] | Succinct Representation, Leaf Languages, and Projection Reductions IEEE Conference on Computational Complexity, pages 118–126, 1996. |
| 1995 | |
| [2] | Succinct Representation and Leaf Languages Electronic Colloquium on Computational Complexity (ECCC), volume 2, number 48, 1995. |
| [1] | Second Order Logic and the Weak Exponential Hierarchies Mathematical Foundations of Computer Science 1995, 20th International Symposium, MFCS'95, Prague, Czech Republic, August 28 - September 1, 1995, Proceedings (Jirí Wiedermann, Petr Hájek, eds.), pages 66–81, 1995, Springer. |
