СТ |
Directed Model Checking with Distance-Preserving Abstraction |
2006 |
Draeger K., Finkbeiner B., Podelski A. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
23.05.2006 |
СТ |
A Complete Method for the Synthesis of Linear Ranking Functions |
2004 |
Podelski A., Rybalchenko A. |
|
|
|
Lecture Notes in Computer Science |
12.02.2004 |
СТ |
Software Model Checking with Abstraction Refinement |
2003 |
Podelski A. |
|
|
|
Lecture Notes in Computer Science |
31.01.2003 |
СТ |
Accurate Widenings and Boundedness Properties of Timed Systems |
2001 |
Mukhopadhyay S., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
06.02.2002 |
СТ |
Model Checking Communication Protocols |
2001 |
Argon P., Delzano G., Mukhopadhyay S., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
08.11.2001 |
СТ |
Boolean and Cartesian Abstraction for Model Checking C Programs |
2001 |
Ball T., Podelski A., Rajamani S. K. |
Lecture Notes in Computer Science |
|
|
Lecture Notes in Computer Science |
08.05.2001 |
СТ |
Constraint Database Models Characterizing Timed Bisimilarity |
2001 |
Mukhopadhyay S., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
05.04.2001 |
СТ |
Efficient Algorithms for Pre and Post on Interprocedural Parallel Flow Graphs |
2000 |
Esparza J., Podelski A. |
|
|
|
Papers Presented at the 27th ACM SIGPLAN-SIGACT Symp. on Pinciples of Programming Languages |
05.06.2000 |
СТ |
Paths vs. Trees in Set-based Program Analysis |
2000 |
Charatonik W., Podelski A., Talbot J. -M. |
|
|
|
Papers Presented at the 27th ACM SIGPLAN-SIGACT Symp. on Pinciples of Programming Languages |
05.06.2000 |
СТ |
Constraint-Based Analysis of Broadcast Protocols |
1999 |
Delzanno G., Esparza J., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
12.11.1999 |
СТ |
Model Checking in CLP |
1999 |
Delzanno G., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
08.04.1999 |
СТ |
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs |
1999 |
Podelski A., Charatonik W., Muller M. |
|
|
|
Lecture Notes in Computer Science |
07.04.1999 |
СТ |
Directional Type Inference for Logic Programs |
1998 |
Charatonik W., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
01.10.1998 |
СТ |
LISA: A Specification Language Based on WS2S |
1998 |
Ayari A., Basin D., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
19.06.1998 |
СТ |
Operational Semantics of Constraint Logic Programs with Coroutining |
1995 |
Podelski A., Smolka G. |
|
|
|
Logic Programming: Proc. of the Twelfth Intern. Conf. |
13.05.1996 |
СТ |
Situatted Simplification |
1995 |
Podelski A., Smolka G. |
Lecture Notes in Computer Science |
|
|
Principles and Practice of Constraint Programming - CP 95 |
16.11.1995 |
СТ |
Ultimately Periodic Words of Rational -Languages |
1994 |
Calbrix H., Nivat M., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
28.06.1994 |
П |
Order-Sorted Feature Theory Unification |
1993 |
Ait-Kaci H., Podelski A., Golstein S. C. |
|
|
Digital |
|
24.02.1994 |
СТ |
Rabin Tree Automata and Finite Monoids |
1993 |
Beauquier D., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
20.10.1993 |
СТ |
Equational and Membership Constraints for Infinite Trees |
1993 |
Niehren J., Podelski A., Treinen R. |
|
|
|
Lecture Notes in Computer Science |
09.07.1993 |
СТ |
Feature Automata and Recognizable Sets of Feature Trees |
1993 |
Niehren J., Podelski A. |
|
|
|
Lecture Notes in Computer Science |
26.05.1993 |
СТ |
Logic Programming with Functions over Order-Sorted Feature Terms |
1992 |
Ait-Kaci H., Podelski A. |
|
|
|
Lecture Notes in Artificial Intelligence |
06.04.1993 |
П |
A Feature Constraint System for Logic Programming with Entailment |
1992 |
Ait-Kaci H., Podelski A., Smolka G. |
|
|
Digital |
|
24.03.1993 |
П |
Functions as Passive Constraints in LIFE |
1992 |
Ait-Kaci H., Podelski A. |
|
|
Digital |
|
11.02.1993 |
П |
Towards a Meaning of LIFE |
1991 |
Ait-Kaci H., Podelski A. |
|
|
Digital |
|
19.05.1992 |