« December 2019 »
December
MoTuWeThFrSaSu
1
2345678
9101112131415
16171819202122
23242526272829
3031
Uni-Logo
You are here: Home Research Data Base Publications
Document Actions

Publications

This page is constructed automatically from the official research data base of the University of Freiburg.  This data base is likely to be out of date. If in doubt, please contact swtsecr@informatik.uni-freiburg.de.

 



Journal Articles

Years: 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1997 | 1994 | 1993 | 1991 | 1989
Icon: top back to the top of all publications

    2016


    • Schilling Christian, Bogomolov Sergiy, Henzinger Thomas, Podelski Andreas, Ruess Jakob
      Adaptive moment closure for parameter inference of biochemical reaction networks
      2016 Biosystems, volume: 149, pages: 15 - 25
    • Leike Jan, Heizmann Matthias
      Geometric Nontermination Arguments
      2016 CoRR, volume: abs/1609.05207
    • Christ J, Hoenicke J
      Proof Tree Preserving Tree Interpolation
      2016 J Autom Reasoning, volume: 57, issue: 1, pages: 67 - 95

    2015


    • Feo Arenis S, Westphal B, Dietsch D, Marco Muñiz, Siyar Andisha, Podelski A
      Ready for Testing: Ensuring Conformance to Industrial Standards through Formal Verification
      2015 Form Asp Comput

    2014


    • Heizmann Matthias, Hoenicke Jochen, Leike Jan, Podelski Andreas
      Linear Ranking for Linear Lasso Programs
      2014 CoRR, volume: abs/1401.5347
    • Ermis E, Nutz A, Dietsch D, Hoenicke J, Podelski A
      Ultimate Kojak (Competition Contribution)
      2014 TACAS, pages: 421 - 423

    2013


    • Damm Werner, Peter Hans-Jörg, Rakow Jan, Westphal Bernd
      Can we build it
      2013 Mathematical Structures in Computer Science, volume: 23, issue: 4, pages: 676 - 725
    • Dietsch Daniel, Podelski Andreas, Nam Jaechang, Papadopoulos Pantelis, Schäf Martin
      Monitoring Student Activity in Collaborative Software Development
      2013 CoRR, volume: abs/1305.0787

    2012


    • Post Amalinda, Menzel Igor, Hoenicke Jochen, Podelski Andreas
      Automotive behavioral requirements expressed in a specification pattern system
      2012 Requir. Eng., volume: 17, issue: 1, pages: 19 - 33
    • Arlt Stephan, Ermis Evren, Arenis Sergio, Podelski Andreas
      Black-Box Verification for GUI Applications
      2012 CoRR, volume: abs/1210.4686
    • Christ Jürgen, Hoenicke Jochen, Schäf Martin
      Towards Bounded Infeasible Code Detection
      2012 CoRR, volume: abs/1205.6527

    2011


    • Post Amalinda, Podelski Andreas
      Automatische Validierung von Anforderungen
      2011 Softwaretechnik-Trends, volume: 31, issue: 1
    • Cook Byron, Podelski Andreas, Rybalchenko Andrey
      Proving program termination
      2011 Commun. ACM, volume: 54, issue: 5, pages: 88 - 98

    2009


    • Dräger Klaus, Finkbeiner Bernd, Podelski Andreas
      Directed model checking with distance-preserving abstractions
      2009 STTT, volume: 11, issue: 1
    • Cook Byron, Podelski Andreas, Rybalchenko Andrey
      Summarization for termination
      2009 Formal Methods in System Design, volume: 35, issue: 3

    2008


    • Meyer Roland, Faber Johannes, Hoenicke Jochen, Rybalchenko Andrey
      Model checking Duration Calculus
      2008 Formal Asp. Comput., volume: 20, issue: 4-5, pages: 481 - 505

    2007


    • Becker Bernd, Podelski Andreas, Damm Werner, Fränzle Martin, Olderog Ernst-Rüdiger, Wilhelm Reinhard
      SFB/TR 14 AVACS - Automatic Verification and Analysis of Complex Systems (Der Sonderforschungsbereich/Transregio 14 AVACS - Automatische Verifikation und Analyse komplexer Systeme)
      2007 it - Information Technology, volume: 49, issue: 2, page: 118
    • Podelski Andreas, Rybalchenko Andrey
      Transition predicate abstraction and fair termination
      2007 ACM Trans. Program. Lang. Syst., volume: 29, issue: 3

    2006


    • Toben Tobe, Westphal Bernd
      Concurrent LSC Verification
      2006 Electr. Notes Theor. Comput. Sci., volume: 145, pages: 95 - 111
    • Westphal Bernd
      LSC Verification for UML Models with Unbounded Creation and Destruction
      2006 Electr. Notes Theor. Comput. Sci., volume: 144, issue: 3, pages: 133 - 145
    • Wies Thomas, Kuncak Viktor, Zee Karen, Podelski Andreas, Rinard Martin
      On Verifying Complex Properties using Symbolic Shape Analysis
      2006 CoRR, volume: abs/cs/0609104
    • Jensen Kurt, Podelski Andreas
      Tools and algorithms for the construction and analysis of systems
      2006 STTT, volume: 8, issue: 3, pages: 177 - 179

    2005


    • Damm Werner, Westphal Bernd
      Live and let die
      2005 Sci. Comput. Program., volume: 55, issue: 1-3, pages: 117 - 159
    • Jensen Kurt, Podelski Andreas
      Special issue
      2005 Theor. Comput. Sci., volume: 345, issue: 1, pages: 1 - 1
    • Blanchet Bruno, Podelski Andreas
      Verification of cryptographic protocols
      2005 Theor. Comput. Sci., volume: 333, issue: 1-2, pages: 67 - 90

    2004


    • Leuschel Michael, Podelski Andreas, Ramakrishnan C, Ultes-Nitsche Ulrich
      Introduction to the Special Issue on Verification and Computational Logic
      2004 TPLP, volume: 4, issue: 5-6, pages: 543 - 544

    2003


    • Ball Thomas, Podelski Andreas, Rajamani Sriram
      Boolean and Cartesian abstraction for model checking C programs
      2003 STTT, volume: 5, issue: 1, pages: 49 - 58

    2002


    • Hoenicke Jochen, Olderog Ernst-Rüdiger
      CSP-OZ-DC
      2002 Nord. J. Comput., volume: 9, issue: 4, pages: 301 - 334
    • Charatonik Witold, Podelski Andreas
      Set Constraints with Intersection
      2002 Inf. Comput., volume: 179, issue: 2, pages: 213 - 229

    2001


    • Delzanno Giorgio, Podelski Andreas
      Constraint-based deductive model checking
      2001 STTT, volume: 3, issue: 3, pages: 250 - 270

    2000


    • Müller Martin, Niehren Joachim, Podelski Andreas
      Ordering Constraints over Feature Trees
      2000 Constraints, volume: 5, issue: 1/2, pages: 7 - 41

    1997


    • Nivat Maurice, Podelski Andreas
      Minimal Ascending and Descending Tree Automata
      1997 SIAM J. Comput., volume: 26, issue: 1, pages: 39 - 58
    • Aït-Kaci Hassan, Podelski Andreas, Goldstein Seth
      Order Sorted Feature Theory Unification
      1997 J. Log. Program., volume: 30, issue: 2, pages: 99 - 124
    • Podelski Andreas, Smolka Gert
      Situated Simplification
      1997 Theor. Comput. Sci., volume: 173, issue: 1, pages: 235 - 252

    1994


    • Aït-Kaci Hassan, Podelski Andreas, Smolka Gert
      A Feature Constraint System for Logic Programming with Entailment
      1994 Theor. Comput. Sci., volume: 122, issue: 1&2, pages: 189 - 200
    • Aït-Kaci Hassan, Podelski Andreas
      Functions as Passive Constraints in LIFE
      1994 ACM Trans. Program. Lang. Syst., volume: 16, issue: 4, pages: 189 - 200
    • Beauquier Danièle, Podelski Andreas
      Rabin Tree Automata and Finite Monoids
      1994 Theor. Comput. Sci., volume: 134, issue: 1, pages: 13 - 25

    1993


    • Nivat Maurice, Podelski Andreas
      Another variation on the common subexpression problem
      1993 Discrete Mathematics, volume: 114, issue: 1-3, pages: 379 - 401
    • Aït-Kaci Hassan, Podelski Andreas
      Towards a Meaning of LIFE
      1993 J. Log. Program., volume: 16, issue: 3, pages: 195 - 234

    1991


    • Courcelle Bruno, Niwinski Damian, Podelski Andreas
      A Geometrical View of the Determinization and Minimization of Finite-State Automata
      1991 Mathematical Systems Theory, volume: 24, issue: 2, pages: 117 - 146

    1989


    • Nivat Maurice, Podelski Andreas
      Definite tree languages
      1989 Bulletin of the EATCS, volume: 38, pages: 186 - 190

    Books

    Years: 2019 | 2018
    Icon: top back to the top of all publications

      2019


      • Springer
        Networked Systems- 6th International Conference, Netys 2018
        ISBN: 9783030055288
        Podelski

      2018


      • Springer
        Static Analysis- 25th International Symposium SAS 2018
        ISBN: 9783319997247
        Podelski, Andreas

      Book chapters

      Years: 2018 | 2017
      Icon: top back to the top of all publications

        2018


        • Hoenicke, Jochen, Nutz, Alexander, Podelski, Andreas
          A Tree-Based Approach to Data Flow Proofs
          In: VSTTE 2018
          2018, Springer,
        • Ranjit Jhala, Andreas Podelski, Andrey Rybalchenko
          Predicate Abstraction for Program Verification
          In: Handbook of Model Checking 2018
          2018, Springer,
        • Podelski, Andreas, Bogomolov, Sergiy, Forets, Marcelo, Frehse, Goran, Viry, Frédéric, Schilling, Christian
          Reach set approximation through decomposition with low- dimentional sets and high-dimentional matrices
          In: HSSC 2018
          2018, ACM,
        • Padon, Oded, Hoenicke, Jochen, McMillan, Kenneth L., Podelski, Andreas, Sagiv, Mooly, Shoham, Sharon
          Temporal Prophecy for Proving Temporal Properties of Infinite-State Systems
          In: Formal methods in Computer Aided Design
          2018, IEEE,
        • Podelski, Andreas, Heizmann, Matthias, Hoenicke, Jochen, Nutz, Alexander
          The map equality domain
          In: VSTTE 2018
          2018, Springer,
        • Heizmann, Matthias, Chen, Yu-Fang, Dietsch, Daniel, Greitschus, Marius, Hoenicke, Jochen, Li, Yong, Nutz, Alexander, Musa, Betim, Schilling, Christian, Schindler, Tanja, Podelski, Andreas
          Ultimate Automizer and the Search for Perfect Interpolants
          In: TACAS (2) 2018
          2018, Springer,
        • Dietsch, Daniel,, Greitschus, Marius, Heizmann, Matthias, Hoenicke, Jochen, Nutz, Alexander, Podelski, Andreas, Schilling, Christian, Schindler, Thomas
          Ultimate Taipan with Dynamic Block Enconding (Competition Contributing)
          In: TACAS (2) 2018
          2018, Springer,

        2017


        • Hoenicke, Jochen, Podelski, Andreas
          Reducing Livenes to safety in first-order logic
          In: PACM: Programming Languages
          2017, ACM,

        Conference papers

        Years: 2018 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991
        Icon: top back to the top of all publications

          2018


          2016


          2015


          • Bogomolov Sergiy, Schilling Christian, Bartocci Ezio, Batt Grégory, Kong Hui, Grosu Radu
            Abstraction-Based Parameter Synthesis for Multiaffine Systems
            2015 Hardware and Software, Springer, volume: 9434, pages: 19 - 35
          • Bogomolov Sergiy, Henzinger Thomas, Podelski Andreas, Ruess Jakob, Schilling Christian
            Adaptive Moment Closure for Parameter Inference of Biochemical Reaction Networks
            2015 Computational Methods in Systems Biology - 13th International Conference, CMSB 2015, Nantes, France, September 16-18, 2015, Proceedings, Springer, volume: 9308, pages: 77 - 89
          • Farzan Azadeh, Heizmann Matthias, Hoenicke Jochen, Kincaid Zachary, Podelski Andreas
            Automated Program Verification
            2015 Language and Automata Theory and Applications - 9th International Conference, LATA 2015, Nice, France, March 2-6, 2015, Proceedings, Springer, volume: 8977, pages: 25 - 46
          • Bak Stanley, Bogomolov Sergiy, Greitschus Marius, Johnson Taylor
            Benchmark Generator for Stratified Controllers of Tank Networks
            2015 Seattle, Washington Applied Verification for Continuous and Hybrid Systems Workshop 2015
          • Sergiy Bogomolov, Marius Greitschus, Peter G. Jensen, Kim G. Larsen, Marius Mikučionis, Thomas Strump, Stavros Tripakis
            Co-Simulation of Hybrid Systems with SpaceEx and Uppaal
            2015 11th International Modelica Conference
             
            Download file as PDF
          • Christ Jürgen, Hoenicke Jochen
            Cutting the Mix
            2015 Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part II, Springer, volume: 9207, pages: 37 - 52
          • Andisha Ahmad, Wehrle Martin, Westphal Bernd
            Directed Model Checking for PROMELA with Relaxation-Based Distance Functions
            2015 Model Checking Software - 22nd International Symposium, SPIN 2015, Stellenbosch, South Africa, August 24-26, 2015, Proceedings, Springer, volume: 9232, pages: 153 - 159
          • Frehse Goran, Bogomolov Sergiy, Greitschus Marius, Strump Thomas, Podelski Andreas
            Eliminating spurious transitions in reachability with support functions
            2015 Proceedings of the 18th International Conference on Hybrid Systems, ACM, pages: 149 - 158
          • Dietsch Daniel, Heizmann Matthias, Langenfeld Vincent, Podelski Andreas
            Fairness Modulo Theory
            2015 Computer Aided Verification - 27th International Conference, CAV 2015, San Francisco, CA, USA, July 18-24, 2015, Proceedings, Part I, Springer, volume: 9206, pages: 49 - 66
          • Hoenicke Jochen, Podelski Andreas
            Fairness for Infinitary Control
            2015 Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany, September 8-9, 2015. Proceedings, Springer, volume: 9360, pages: 33 - 43
          • Nguyen Luan, Schilling Christian, Bogomolov Sergiy, Johnson Taylor
            HyRG a random generation tool for affine hybrid automata
            2015 Proceedings of the 18th International Conference on Hybrid Systems, ACM, pages: 289 - 290
          • Farzan A, Kincaid Z, Podelski A
            Proof Spaces for Unbounded Parallelism
            2015 POPL 42nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages: 407 - 420
          • Herrera Christian, Westphal Bernd
            Quasi-equal Clock Reduction
            2015 Hardware and Software, Springer, volume: 9434, pages: 173 - 189
          • Nguyen Luan, Schilling Christian, Bogomolov Sergiy, Johnson Taylor
            Runtime Verification for Hybrid Analysis Tools
            2015 Runtime Verification - 6th International Conference, RV 2015 Vienna, Austria, September 22-25, 2015. Proceedings, Springer, volume: 9333, pages: 281 - 286
          • Arlt Stephan, Arenis Sergio, Podelski Andreas, Wehrle Martin
            System Testing and Program Verification
            2015 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, GI, volume: 239, pages: 71 - 72
          • Nutz Alexander, Dietsch Daniel, Mohamed Mostafa, Podelski Andreas
            ULTIMATE KOJAK with Memory Safety Checks - (Competition Contribution)
            2015 Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, Springer, volume: 9035, pages: 458 - 460
          • Heizmann Matthias, Dietsch Daniel, Leike Jan, Musa Betim, Podelski Andreas
            Ultimate Automizer with Array Interpolation - (Competition Contribution)
            2015 Tools and Algorithms for the Construction and Analysis of Systems - 21st International Conference, TACAS 2015, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2015, London, UK, April 11-18, 2015. Proceedings, Springer, volume: 9035, pages: 455 - 457
          • Christ Jürgen, Hoenicke Jochen
            Weakly Equivalent Arrays
            2015 Frontiers of Combining Systems - 10th International Symposium, FroCoS 2015, Wroclaw, Poland, September 21-24, 2015. Proceedings, Springer, volume: 9322, pages: 119 - 134
          • Beyer Dirk, Dangl Matthias, Dietsch Daniel, Heizmann Matthias, Stahlbauer Andreas
            Witness validation and stepwise testification across software verifiers
            2015 Proceedings of the 2015 10th Joint Meeting on Foundations of Software Engineering, ESEC/FSE 2015, Bergamo, Italy, August 30 - September 4, 2015, ACM, pages: 721 - 733

          2014


          • Bogomolov S, Frehse G, Greitschus M, Grosu R, Pasareanu C, Podelski A, Strump T
            Assume-Guarantee Abstraction Refinement Meets Hybrid Systems
            2014 Haifa Verification Conference Journal of the ACM, pages: 116 - 131
          • Leike Jan, Heizmann Matthias
            Geometric Series as Nontermination Arguments for Linear Lasso Programs
            2014 WST, pages: 55 - 59
          • Jubran Oday, Westphal Bernd
            Optimizing guard time for TDMA in a wireless sensor network - Case study
            2014 IEEE 39th Conference on Local Computer Networks, Edmonton, AB, Canada, 8-11 September, 2014 - Workshop Proceedings, IEEE, pages: 597 - 601
          • Bogomolov S, Magazzeni D, Podelski A, Wehrle M
            Planning as Model Checking in Hybrid Domains
            2014 AAAI AAAI 2014, pages: 2228 - 2234
          • Farzan, Azadeh, Kincaid, Zachary, Podelski Andreas
            Proofs that count
            2014 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM, pages: 151 - 164
          • Herrera Christian, Westphal Bernd, Podelski Andreas
            Quasi-Equal Clock Reduction
            2014 Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings, Springer, volume: 8413, pages: 295 - 309
          • Bogomolov S, Herrera C, Muniz M, Westphal B, Podelski A
            Quasi-dependent variables in hybrid automata
            2014 Haifa Verification Conference Journal of the ACM, pages: 93 - 102
          • Jan Leike, Matthias Heizmann
            Ranking Templates for Linear Loops
            2014 Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, {TACAS} 2014, Held as Part of the Joint Conferences on Theory TACAS, Springer, volume: 8413, pages: 172 - 186
          • Heizmann Matthias, Hoenicke Jochen, Podelski Andreas
            Termination Analysis by Learning Terminating Programs
            2014 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, Springer, volume: 8559, pages: 797 - 813
          • Feo Arenis S, Westphal Bernd, Dietsch Daniel, Muñiz Marco, Andisha Ahmad
            The Wireless Fire Alarm System
            2014 FM 2014, Springer, volume: 8442, pages: 658 - 672
          • Arenis Sergio, Westphal Bernd, Dietsch Daniel, Muñiz Marco, Andisha Ahmad
            The Wireless Fire Alarm System
            2014 FM 2014, Springer, volume: 8442, pages: 658 - 672
          • Mahdi Ahmed, Westphal Bernd, Fränzle Martin
            Transformations for Compositional Verification of Assumption-Commitment Properties
            2014 Reachability Problems - 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings, Springer, volume: 8762, pages: 216 - 229
          • Matthias Heizmann, Jürgen Christ, Daniel Dietsch, Jochen Hoenicke, Markus Lindenmann, Betim Musa, Christian Schilling, Stefan Wissert, Andreas Podelski
            Ultimate Automizer with Unsatisfiable Cores - (Competition Contribution)
            2014 Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, {TACAS} 2014, Held as Part of the Joint Conferences on Theory Springer, volume: 8413, pages: 418 - 420
          • Heizmann Matthias, Christ Jürgen, Dietsch Daniel, Hoenicke Jochen, Lindenmann Markus, Musa Betim, Schilling Christian, Wissert Stefan, Podelski Andreas
            Ultimate Automizer with Unsatisfiable Cores - (Competition Contribution)
            2014 Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings, Springer, volume: 8413, pages: 418 - 420
          • Ermis Evren, Nutz Alexander, Dietsch Daniel, Hoenicke Jochen, Podelski Andreas
            Ultimate Kojak - (Competition Contribution)
            2014 Tools and Algorithms for the Construction and Analysis of Systems - 20th International Conference, TACAS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014, Grenoble, France, April 5-13, 2014. Proceedings, Springer, volume: 8413, pages: 421 - 423
          • Arlt Stephan, Ermis Evren, Arenis Sergio, Podelski Andreas
            Verification of GUI Applications
            2014 Leveraging Applications of Formal Methods, Verification and Validation. Technologies for Mastering Change - 6th International Symposium, ISoLA 2014, Imperial, Corfu, Greece, October 8-11, 2014, Proceedings, Part I, Springer, volume: 8802, pages: 236 - 252

          2013


          • Schilling Christian, Smaus Jan-Georg, Wenzelmann Fabian
            A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
            2013 Combinatorial Algorithms - 24th International Workshop, IWOCA 2013, Rouen, France, July 10-12, 2013, Revised Selected Papers, Springer, volume: 8288, pages: 458 - 462
          • Bogomolov Sergiy, Donzé Alexandre, Frehse Goran, Grosu Radu, Johnson Taylor, Ladan Hamed, Podelski Andreas, Wehrle Martin
            Abstraction-Based Guided Search for Hybrid Systems
            2013 SPIN, Springer, volume: 7976, pages: 117 - 134
          • Podelski Andreas
            Automata as Proofs
            2013 VMCAI, Springer, volume: 7737, pages: 13 - 14
          • Muñiz Marco, Westphal Bernd, Podelski Andreas
            Detecting Quasi-equal Clocks in Timed Automata
            2013 FORMATS, Springer, volume: 8053, pages: 198 - 212
          • Feo Arenis S, Westphal Bernd
            Formal Verification of a Parameterized Data Aggregation Protocol
            2013 NASA Formal Methods, Springer, volume: 7871, pages: 428 - 434
          • Jubran Oday, Westphal Bernd
            Formal approach to guard time optimization for TDMA
            2013 RTNS, ACM, pages: 223 - 233
          • Farzan Azadeh, Kincaid Zachary, Podelski Andreas
            Inductive data floow graphs
            2013 POPL' 13, Rom 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), ACM, volume: 48, issue: 1, pages: 129 - 142
          • Heizmann Matthias, Hoenicke Jochen, Leike Jan, Podelski Andreas
            Linear Ranking for Linear Lasso Programs
            2013 ATVA, Springer, volume: 8172, pages: 365 - 380
          • Feo Arenis S, Westphal Bernd
            Parameterized Verification of Track Topology Aggregation Protocols
            2013 FMOODS/FORTE, Springer, volume: 7892, pages: 35 - 49
          • Christ Jürgen, Hoenicke Jochen, Nutz Alexander
            Proof Tree Preserving Interpolation
            2013 TACAS, Springer, volume: 7795, pages: 124 - 138
          • Abdulla Parosh, Atig Mohamed, Delzanno Giorgio, Podelski Andreas
            Push-Down Automata with Gap-Order Constraints
            2013 FSEN, Springer, volume: 8161, pages: 199 - 216
          • Heizmann Matthias, Hoenicke Jochen, Podelski Andreas
            Software Model Checking for People Who Love Automata
            2013 CAV, Springer, volume: 8044, pages: 36 - 52
          • Heizmann Matthias, Christ Jürgen, Dietsch Daniel, Ermis Evren, Hoenicke Jochen, Lindenmann Markus, Nutz Alexander, Schilling Christian, Podelski Andreas
            Ultimate Automizer with SMTInterpol - (Competition Contribution)
            2013 Tools and Algorithms for the Construction and Analysis of Systems - 19th International Conference, TACAS 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings, Springer, volume: 7795, pages: 641 - 643

          2012


          • Bogomolov Sergiy, Frehse Goran, Grosu Radu, Ladan Hamed, Podelski Andreas, Wehrle Martin
            A Box-Based Distance between Regions for Guiding the Reachability Analysis of SpaceEx
            2012 CAV, Springer, volume: 7358, pages: 479 - 494
          • Post Amalinda, Hoenicke Jochen
            Formalization and Analysis of Real-Time Requirements
            2012 VSTTE, Springer, volume: 7152, pages: 225 - 240
          • Smaus Jan-Georg, Schilling Christian, Wenzelmann Fabian
            Implementations of two algorithms for the threshold synthesis problem
            2012 International Symposium on Artificial Intelligence and Mathematics (ISAIM 2012), Fort Lauderdale, Florida, USA, January 9-11, 2012
          • Podelski Andreas
            Interpolant Automata - (Invited Talk)
            2012 ATVA, Springer, volume: 7561
          • Arlt Stephan, Podelski Andreas, Bertolini Cristiano, Schäf Martin, Banerjee Ishan, Memon Atif
            Lightweight Static Analysis for GUI Testing
            2012 ISSRE, IEEE, pages: 301 - 310
          • Barth Jelena, Westphal Bernd, Arlt Stephan
            Model-based development of embedded systems' user interfaces
            2012 ACM, volume: ACES-MB '12, pages: 37 - 42
          • Arlt Stephan, Borromeo Pedro, Schäf Martin, Podelski Andreas
            Parameterized GUI Tests
            2012 ICTSS, Springer, volume: 7641, pages: 247 - 262
          • Herrera Christian, Westphal Bernd, Arenis Sergio, Muñiz Marco, Podelski Andreas
            Reducing Quasi-Equal Clocks in Networks of Timed Automata
            2012 FORMATS, Springer, volume: 7595, pages: 155 - 170
          • Christ Jürgen, Hoenicke Jochen, Nutz Alexander
            SMTInterpol
            2012 SPIN, Springer, volume: 7385, pages: 248 - 254
          • Ermis Evren, Hoenicke Jochen, Podelski Andreas
            Splitting via Interpolants
            2012 VMCAI, Springer, volume: 7148, pages: 186 - 201
          • Muñiz Marco, Westphal Bernd, Podelski Andreas
            Timed Automata with Disjoint Activity
            2012 FORMATS, Springer, volume: 7595, pages: 188 - 203
          • Westphal Bernd, Dietsch Daniel, Arenis Sergio, Podelski Andreas, Pahlow Louis, Morsbach Jochen, Sommer Barbara, Fuchs Anke, Meierhöfer Christine
            Towards successful subcontracting for software in small to medium-sized enterprises
            2012 RELAW, IEEE, pages: 42 - 51
          • Westphal Bernd, Dietsch Daniel, Arenis Sergio, Podelski Andreas, Pahlow Louis, Morsbach Jochen, Sommer Barbara, Fuchs Anke, Meierhöfer Christine
            Towards successful subcontracting for software in small to medium-sized enterprises
            2012 Fifth IEEE International Workshop on Requirements Engineering and Law, RELAW 2012, Chicago, IL, USA, September 25, 2012, IEEE Computer Society, pages: 42 - 51
          • Kuncak Viktor, Rybalchenko Andrey
            Verification, Model Checking, and Abstract Interpretation - 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012. Proceedings
            2012 SpringerLecture Notes in Computer Science, Springer, volume: 7148
          • Joshi Rajeev, Müller Peter, Podelski Andreas
            Verified Software
            2012 SpringerLecture Notes in Computer Science, Springer, volume: 7152

          2011


          • Kupferschmid Sebastian, Wehrle Martin
            Abstractions and Pattern Databases: The Quest for Succinctness and Accuracy
            2011 TACAS, Springer, volume: 6605, pages: 276 - 290
          • Post Amalinda, Menzel Igor, Podelski Andreas
            Applying Restricted English Grammar on Automotive Requirements - Does it Work?
            2011 REFSQ, Springer, volume: 6606, pages: 166 - 180
          • Post Amalinda, Menzel Igor, Podelski Andreas
            Applying restricted English grammar on automotive requirements - does it work? A case study
            2011 REFSQ, Springer, volume: LNCS 6606, pages: 166 - 180
          • Arlt Stephan, Bertolini Christiano, Schäf Martin
            Behind the Scenes: An Approach to Incorporate Context in GUI Test Case Generation
            2011 TESTBEDS
          • Mitrohin Corina, Podelski Andreas
            Composing Stability Proofs for Hybrid Systems
            2011 FORMATS, Springer, volume: 6919, pages: 286 - 300
          • Dietsch Daniel, Arenis Sergio, Westphal Bernd, Podelski Andreas
            Disambiguation of industrial standards through formalization and graphical languages
            2011 RE 2011, 19th IEEE International Requirements Engineering Conference, Trento, Italy, August 29 2011 - September 2, 2011, IEEE Computer Society, pages: 265 - 270
          • Cook, Byron, Podelksi, Andreas, Rybalchenko, Andrey
            Proving program termination
            2011 Commun Acm, ACM, volume: 54, issue: 5, pages: 88 - 98
          • Dietsch Daniel, Westphal Bernd, Podelski Andreas
            System Verification through Program Verification
            2011 FM 2011, Springer, volume: 6664, pages: 27 - 41
          • Podelski Andreas, Rybalchenko Andrey
            Transition Invariants and Transition Predicate Abstraction for Program Termination
            2011 TACAS, Springer, volume: 6605, pages: 3 - 10
          • Post Amalinda, Hoenicke Jochen, Podelski Andreas
            Vacuous real-time requirements
            2011 RE, IEEE, pages: 153 - 162
          • Post Amalinda, Hoenicke Jochen, Podelski Andreas
            rt-Inconsistency
            2011 FASE, Springer, volume: 6603, pages: 34 - 49
          • Post Amalinda, Hoenicke Jochen, Podelski Andreas
            rt-inconsistency - a new property of real time requirements
            2011 FASE, pages: 34 - 49

          2010


          • Seghir Mohamed Nassim
            An Assume Guarantee Approach for Checking Quantified Array
            2010 AMAST, volume: 6486/2011, pages: 226 - 235
          • Post Amalinda, Podelski Andreas
            Automatische Validierung von Verhaltensanforderungen.
            2010 Softwaretechnik-Trends, volume: 30, issue: 4
          • Bogomolov Sergiy, Mitrohin Corina, Podelski Andreas
            Composing Reachability Analyses of Hybrid Systems for Safety and Stability
            2010 ATVA, pages: 67 - 81
          • Wehrle Martin, Kupferschmid Sebastian
            Context-Enhanced Directed Model Checking
            2010 SPIN, pages: 88 - 105
          • Podelski Andreas, Wies Thomas
            Counterexample-guided focus
            2010 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages: 249 - 260
          • Olderog Ernst-Rüdiger, Podelski Andreas
            Explicit Fair Scheduling for Dynamic Control
            2010 Concurrency, Compositionality, and Correctness, pages: 96 - 117
          • Hoenicke Jochen, Olderog Ernst-Rüdiger, Podelski Andreas
            Fairness for Dynamic Control
            2010 TACAS, pages: 251 - 265
          • Hoenicke Jochen, Meyer Roland, Olderog Ernst-Rüdiger
            Kleene, Rabin, and Scott Are Available
            2010 CONCUR, pages: 462 - 477
          • Heizmann Matthias, Hoenicke Jochen, Podelski Andreas
            Nested interpolants
            2010 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages: 471 - 482
          • Bogomolov Sergiy, Mann Martin, Voß Björn, Podelski Andreas, Backofen Rolf
            Shape-based Barrier Estimation for RNAs
            2010 GCP, pages: 41 - 50
          • Heizmann Matthias, Jones Neil, Podelski Andreas
            Size-Change Termination and Transition Invariants
            2010 SAS, pages: 22 - 50
          • Toben Tobe, Westphal Bernd, Rakow Jan-Hendrik
            Spotlight Abstraction of Agents and Areas
            2010 Quantitative and Qualitative Analysis of Network Protocols, 31.01. - 05.02.2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, volume: 10051
          • Malkis Alexander, Podelski Andreas, Rybalchenko Andrey
            Thread-Modular Counterexample-Guided Abstraction Refinement
            2010 SAS, pages: 356 - 372
          • Berstel Bruno, Leconte Michel
            Using Constraints to Verify Properties of Rule Programs
            2010 CSTVA

          2009


          • Seghir Mohamed, Podelski Andreas, Wies Thomas
            Abstraction Refinement for Quantified Array Assertions
            2009 SAS, pages: 3 - 18
          • Hoenicke Jochen, Leino K, Podelski Andreas, Schäf Martin, Wies Thomas
            It’s Doomed; We Can Prove It
            2009 FM, pages: 338 - 353
          • Heizmann Matthias, Hoenicke Jochen, Podelski Andreas
            Refinement of Trace Abstraction
            2009 SAS, pages: 69 - 85
          • Wehrle Martin, Helmert Malte
            The Causal Graph Revisited for Directed Model Checking
            2009 SAS, pages: 86 - 101
          • Wehrle Martin, Kupferschmid Sebastian, Podelski Andreas
            Transition-Based Directed Model Checking
            2009 TACAS, pages: 186 - 200

          2008


          • Kupferschmid Sebastian, Wehrle Martin, Nebel Bernhard, Podelski Andreas
            Faster Than Uppaal?
            2008 CAV, pages: 552 - 555
          • Podelski Andreas, Rybalchenko Andrey, Wies Thomas
            Heap Assumptions on Demand
            2008 CAV, pages: 314 - 327
          • Dimitrova Rayna, Podelski Andreas
            Is Lazy Abstraction a Decision Procedure for Broadcast Protocols?
            2008 VMCAI, pages: 98 - 111
          • Wehrle Martin, Kupferschmid Sebastian, Podelski Andreas
            Useless Actions Are Useful
            2008 ICAPS, pages: 388 - 395
          • Podelski Andreas
            Verification, Least-Fixpoint Checking, Abstraction
            2008 VSTTE, page: 3
          • Maus Stefan, Moskal Michal, Schulte Wolfram
            Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
            2008 AMAST, pages: 284 - 298

          2007


          • Podelski Andreas, Wagner Silke
            A Sound and Complete Proof Rule for Region Stability of Hybrid Systems
            2007 HSCC, pages: 750 - 753
          • Seghir Mohamed, Podelski Andreas
            ACSAR
            2007 SPIN, pages: 274 - 278
          • Podelski Andreas, Rybalchenko Andrey
            ARMC
            2007 PADL, pages: 245 - 259
          • Bauer Jörg, Toben Tobe, Westphal Bernd
            Mind the Shapes
            2007 ATVA, pages: 35 - 50
          • Wehrle Martin, Rintanen Jussi
            Planning as Satisfiability with Relaxed E-Step Plans
            2007 Australian Conference on Artificial Intelligence, pages: 244 - 253
          • Malkis Alexander, Podelski Andreas, Rybalchenko Andrey
            Precise Thread-Modular Verification
            2007 SAS, pages: 218 - 232
          • Leuschel Michael, Podelski Andreas
            Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 14-16, 2007, Wroclaw, Poland
            2007 ACM
          • Cook Byron, Gotsman Alexey, Podelski Andreas, Rybalchenko Andrey, Vardi Moshe
            Proving that programs eventually do something good
            2007 POPL, pages: 265 - 276
          • Cook Byron, Podelski Andreas, Rybalchenko Andrey
            Proving thread termination
            2007 PLDI, pages: 320 - 330
          • Berstel Bruno, Bonnard Philippe, Bry François Eckert Michael, Patranjan Paula-Lavinia
            Reactive Rules on the Web
            2007 Reasoning Web, pages: 183 - 239
          • Podelski Andreas, Wagner Silke
            Region Stability Proofs for Hybrid Systems
            2007 FORMATS, pages: 320 - 335
          • Wachter Björn, Westphal Bernd
            The Spotlight Principle
            2007 VMCAI, pages: 182 - 198
          • Kupferschmid Sebastian, Dräger Klaus, Hoffmann Jörg, Finkbeiner Bernd, Dierks Henning, Podelski Andreas, Behrmann Gerd
            Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking
            2007 TACAS, pages: 679 - 682
          • Bauer Jörg, Damm Werner, Toben Tobe, Westphal Bernd
            Verification and Synthesis of OCL Constraints Via Topology Analysis
            2007 AGTIVE, pages: 361 - 376
          • Cook Byron, Podelski Andreas
            Verification, Model Checking, and Abstract Interpretation, 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings
            2007 Lecture Notes in Computer Science, Springer, volume: 4349

          2006


          • Klose Jochen, Toben Tobe, Westphal Bernd, Wittke Hartmut
            Check It Out
            2006 CAV, pages: 219 - 233
          • Dräger Klaus, Finkbeiner Bernd, Podelski Andreas
            Directed Model Checking with Distance-Preserving Abstractions
            2006 SPIN, pages: 19 - 34
          • Gorges Thomas, Haug Karsten, Oertel Amalinda, Rosenstiel Wolfgang
            Einsatz eines Fehlerschätzmodells zur Effizienzsteigerung im Software Testprozess
            2006 FKFS AutoTest
          • Berstel Bruno, Leconte Michel
            Extending a CP Solver With Congruences as Domains for Software Verification
            2006 CP, pages: 337 - 343
          • Wies Thomas, Kuncak Viktor, Lam Patrick, Podelski Andreas, Rinard Martin
            Field Constraint Analysis
            2006 VMCAI, pages: 157 - 173
          • Podelski Andreas, Wagner Silke
            Model Checking of Hybrid Systems
            2006 HSCC, pages: 507 - 521
          • Damm Werner, Toben Tobe, Westphal Bernd
            On the Expressive Power of Live Sequence Charts
            2006 Program Analysis and Compilation, pages: 225 - 246
          • Toben Tobe, Westphal Bernd
            On the Expressive Power of Live Sequence Charts
            2006 SOFSEM
          • Bauer Jörg, Schaefer Ina, Toben Tobe, Westphal Bernd
            Specification and Verification of Dynamic Communication Systems
            2006 ACSD, pages: 189 - 200
          • Cook Byron, Podelski Andreas, Rybalchenko Andrey
            Termination proofs for systems code
            2006 PLDI, pages: 415 - 426
          • Cook Byron, Podelski Andreas, Rybalchenko Andrey
            Terminator
            2006 CAV, pages: 415 - 418
          • Westphal Bernd, Toben Tobe
            The Good, the Bad and the Ugly
            2006 FASE, pages: 230 - 246
          • Malkis Alexander, Podelski Andreas, Rybalchenko Andrey
            Thread-Modular Verification Is Cartesian Abstract Interpretation
            2006 ICTAC, pages: 183 - 197
          • Hoffmann Jörg, Smaus Jan-Georg, Rybalchenko Andrey, Kupferschmid Sebastian, Podelski Andreas
            Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL
            2006 MoChArt, pages: 51 - 66

          2005


          • Cook Byron, Podelski Andreas, Rybalchenko Andrey
            Abstraction Refinement for Termination
            2005 SAS, pages: 87 - 101
          • Podelski Andreas, Wies Thomas
            Boolean Heaps
            2005 SAS, pages: 268 - 283
          • Mrugalla Christian, Robbe Oliver, Schinz Ingo, Toben Tobe, Westphal Bernd
            Formal Verification of a Sensor Voting and Monitoring UML Model
            2005 CSDUML
          • Daum Matthias, Maus Stefan, Schirmer Norbert, Seghir Mohamed Nassim
            Integration of a Software Model Checker into Isabelle
            2005 LPAR, pages: 381 - 395
          • Hoenicke Jochen, Maier Patrick
            Model-Checking of Specifications Integrating Processes, Data and Time
            2005 FM, pages: 465 - 480
          • Pnueli Amir, Podelski Andreas, Rybalchenko Andrey
            Separating Fairness and Well-Foundedness for the Analysis of Fair Discrete Systems
            2005 TACAS, pages: 124 - 139
          • Podelski Andreas, Schaefer Ina, Wagner Silke
            Summaries for While Programs with Recursion
            2005 ESOP, pages: 94 - 107
          • Podelski Andreas, Rybalchenko Andrey
            Transition predicate abstraction and fair termination
            2005 POPL, pages: 132 - 144
          • Klose Jochen, Westphal Bernd
            Verification of a Radio-based Signaling System Using Scenarios
            2005 VDI

          2004


          • Podelski Andreas, Rybalchenko Andrey
            A Complete Method for the Synthesis of Linear Ranking Functions
            2004 VMCAI, pages: 239 - 251
          • Podelski Andreas
            Constraints in Program Analysis and Verification
            2004 CP, pages: 1 - 4
          • Brill Matthias, Buschermöhle Ralf, Damm Werner, Klose Jochen, Westphal Bernd, Wittke Hartmut
            Formal Verification of LSCs in the Development Process
            2004 SoftSpez Final Report, pages: 494 - 516
          • Damm Werner, Westphal Bernd
            Introduction to Subject Area ’Charts’
            2004 SoftSpez Final Report, pages: 322 - 324
          • Brill Matthias, Damm Werner, Klose Jochen, Westphal Bernd, Wittke Hartmut
            Live Sequence Charts
            2004 SoftSpez Final Report, pages: 374 - 399
          • Schinz Ingo, Toben Tobe, Mrugalla Christian, Westphal Bernd
            The Rhapsody UML Verification Environment
            2004 SEFM, pages: 174 - 183
          • Jensen Kurt, Podelski Andreas
            Tools and Algorithms for the Construction and Analysis of Systems, 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings
            2004 Lecture Notes in Computer Science, Springer, volume: 2988
          • Podelski Andreas, Rybalchenko Andrey
            Transition Invariants
            2004 LICS, pages: 32 - 41

          2003


          • Podelski Andreas
            Software Model Checking with Abstraction Refinement
            2003 VMCAI, pages: 1 - 3
          • Blanchet Bruno, Podelski Andreas
            Verification of Cryptographic Protocols
            2003 FoSSaCS, pages: 136 - 152

          2002


          • Mukhopadhyay Supratik, Podelski Andreas
            An Algebraic Framework for Abstract Model Checking
            2002 SARA, pages: 152 - 169
          • Hoenicke Jochen, Olderog Ernst-Rüdiger
            Combining Specification Techniques for Processes, Data and Time
            2002 IFM, pages: 245 - 266
          • Charatonik Witold, Mukhopadhyay Supratik, Podelski Andreas
            Compositional Termination Analysis of Symbolic Forward Analysis
            2002 VMCAI, pages: 109 - 125
          • Charatonik Witold, Mukhopadhyay Supratik, Podelski Andreas
            Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
            2002 ICLP, pages: 115 - 129
          • Berstel Bruno
            Extending the RETE Algorithm for Event Management
            2002 TIME, pages: 49 - 51
          • Damm Werner, Westphal Bernd
            Live and Let Die
            2002 FMCO, pages: 99 - 135
          • Ball Thomas, Podelski Andreas, Rajamani Sriram
            Relative Completeness of Abstraction Refinement for Software Model Checking
            2002 TACAS, pages: 158 - 172

          2001


          • Mukhopadhyay Supratik, Podelski Andreas
            Accurate Widenings and Boundedness Properties of Timed Systems
            2001 Ershov Memorial Conference, pages: 79 - 94
          • Ball Thomas, Podelski Andreas, Rajamani Sriram
            Boolean and Cartesian Abstraction for Model Checking C Programs
            2001 TACAS, pages: 268 - 283
          • Mukhopadhyay Supratik, Podelski Andreas
            Constraint Database Models Characterizing Timed Bisimilarity
            2001 PADL, pages: 245 - 258
          • Argón Pablo, Delzanno Giorgio, Mukhopadhyay Supratik, Podelski Andreas
            Model Checking Communication Protocols
            2001 SOFSEM, pages: 160 - 170

          2000


          • Köster Frank, Radtke Roland, Westphal Bernd, Sonnenschein Michael
            Combining Methodical Procedures from Knowledge Discovery in Databases and Individual-Oriented Simulation – Data Mining in Time Series
            2000 ISMDA, pages: 169 - 182
          • Esparza Javier, Podelski Andreas
            Efficient Algorithms for pre$^\mbox*$ and post$^\mbox*$ on Interprocedural Parallel Flow Graphs
            2000 POPL, pages: 1 - 11
          • Köster Frank, Westphal Bernd, Meyer Wolfgang, Sonnenschein Michael
            Eine Unterstützung umweltepidemiologischer Untersuchungen durch die integrierte Anwendung individuenorientierter Simulationen und Techniken des Knowledge Discovery in Databases - Data Mining in Zeitreihen
            2000 ASIM
          • Podelski Andreas
            Model Checking as Constraint Solving
            2000 SAS, pages: 22 - 37
          • Mukhopadhyay Supratik, Podelski Andreas
            Model Checking for Timed Logic Processes
            2000 Computational Logic, pages: 598 - 612
          • Charatonik Witold, Podelski Andreas, Talbot Jean-Marc
            Paths vs. Trees in Set-Based Program Analysis
            2000 POPL, pages: 330 - 337

          1999


          • Mukhopadhyay Supratik, Podelski Andreas
            Beyond Region Graphs
            1999 FSTTCS, pages: 232 - 244
          • Delzanno Giorgio, Esparza Javier, Podelski Andreas
            Constraint-Based Analysis of Broadcast Protocols
            1999 CSL, pages: 50 - 66
          • Delzanno Giorgio, Podelski Andreas
            Model Checking in CLP
            1999 TACAS, pages: 223 - 239
          • Podelski Andreas, Charatonik Witold, Müller Martin
            Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
            1999 ESOP, pages: 177 - 192
          • Delzanno Giorgio, Podelski Andreas
            Verification of Infinite-State Systems in Constraint Logic Programming
            1999 JFPLC, pages: 13 - 22

          1998


          • Charatonik Witold, Podelski Andreas
            Co-definite Set Constraints
            1998 RTA, pages: 211 - 225
          • Charatonik Witold, Podelski Andreas
            Directional Type Inference for Logic Programs
            1998 SAS, pages: 278 - 294
          • Charatonik Witold, Podelski Andreas
            Set-Based Analysis of Reactive Infinite-State Systems
            1998 TACAS, pages: 358 - 375
          • Charatonik Witold, McAllester David, Niwinski Damian, Podelski Andreas, Walukiewicz Igor
            The Horn Mu-calculus
            1998 LICS, pages: 58 - 69

          1997


          • Müller Martin, Niehren Joachim, Podelski Andreas
            Inclusion Constraints over Non-empty Sets of Trees
            1997 TAPSOFT, pages: 345 - 356
          • Ayari Abdelwaheb, Basin David, Podelski Andreas
            LISA
            1997 CSL, pages: 18 - 34
          • Müller Martin, Niehren Joachim, Podelski Andreas
            Ordering Constraints over Feature Trees
            1997 CP, pages: 297 - 311
          • Pacholski Leszek, Podelski Andreas
            Set Constraints
            1997 CP, pages: 549 - 562
          • Charatonik Witold, Podelski Andreas
            Set Constraints with Intersection
            1997 LICS, pages: 362 - 372
          • Podelski Andreas
            Set-Based Analysis of Logic Programs and Reactive Logic Programs (Abstract)
            1997 ILPS, pages: 35 - 36

          1996


          • Charatonik Witold, Podelski Andreas
            The Independence Property of a Class of Set Constraints
            1996 CP, pages: 76 - 90

          1995


          • Podelski Andreas, Roy Peter
            A Detailed Algorithm Testing Guards over Feature Trees
            1995 Constraint Processing, Selected Papers, pages: 11 - 38
          • Podelski Andreas
            Constraint Programming
            1995 Lecture Notes in Computer Science, volume: 910
          • Podelski Andreas, Smolka Gert
            Operational Semantics of Constraint Logic Programs with Coroutining
            1995 ICLP, pages: 449 - 463
          • Podelski Andreas, Smolka Gert
            Situated Simplification
            1995 ICLP, page: 826
          • Podelski Andreas, Smolka Gert
            Situated Simplification
            1995 CP, pages: 328 - 344

          1994


          • Podelski Andreas, Roy Peter
            The Beauty and the Beast Algorithm
            1994 SLP, pages: 359 - 374

          1993


          • Aït-Kaci Hassan, Podelski Andreas
            Entailment and Disentailment of Order-Sorted Feature Constraints
            1993 PPCP, pages: 189 - 200
          • Niehren Joachim, Podelski Andreas, Treinen Ralf
            Equational and Membership Constraints for Finite Trees
            1993 RTA, pages: 106 - 120
          • Niehren Joachim, Podelski Andreas
            Feature Automata and Recognizable Sets of Feature Trees
            1993 TAPSOFT, pages: 356 - 375
          • Aït-Kaci Hassan, Podelski Andreas, Goldstein Seth
            Order-Sorted Feature Theory Unification
            1993 ILPS, pages: 506 - 524
          • Beauquier Danièle, Podelski Andreas
            Rabin Tree Automata and Finite Monoids
            1993 MFCS, pages: 262 - 271
          • Podelski Andreas, Roy Peter
            The Beauty and the Beast Algorithm
            1993 ILPS, page: 653
          • Calbrix Hugues, Nivat Maurice, Podelski Andreas
            Ultimately Periodic Words of Rational -Languages
            1993 MFPS, pages: 554 - 566

          1992


          • Aït-Kaci Hassan, Podelski Andreas, Smolka Gert
            A Feature-Based Constraint System for Logic Programming with Entailment
            1992 FGCS, pages: 189 - 200
          • Aït-Kaci Hassan, Podelski Andreas
            Logic Programming with Functions over Order-Sorted Feature Terms
            1992 ELP, pages: 100 - 119
          • Péladeau Pierre, Podelski Andreas
            On Reverse and General Definite Tree Languages (Extended Abstract)
            1992 ICALP, pages: 150 - 161

          1991


          • Aït-Kaci Hassan, Podelski Andreas
            Towards a Meaning of LIFE
            1991 PLILP, pages: 255 - 274

          Other publications

          Years: 1992
          Icon: top back to the top of all publications

            1992


            • Podelski Andreas
              A monoid approach to tree automata
              Tree Automata and Languages, pages: 41 - 56, 1992
            Credits: SILK Icons by http://www.famfamfam.com/lab/icons/silk/
            Personal tools