| Publication | Date of Publication | Type |
|---|
Early detection of temporal constraint violations
Information and Computation | 2024-01-18 | Paper |
Linear constraint query languages expressive power and complexity
Lecture Notes in Computer Science | 2023-12-12 | Paper |
| GSM+T: a timed artifact-centric process model | 2022-05-28 | Paper |
On reachability and safety in infinite-state systems
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
Conversation protocols: a formalism for specification and verification of reactive electronic services
Implementation and Application of Automata | 2010-05-07 | Paper |
Minimum-cost delegation in service composition
Theoretical Computer Science | 2009-01-08 | Paper |
A representation independent language for planar spatial databases with Euclidean distance
Journal of Computer and System Sciences | 2007-08-23 | Paper |
Automated Technology for Verification and Analysis
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
On composition and lookahead delegation of \(e\)-services modeled by automata
Theoretical Computer Science | 2005-09-22 | Paper |
Computer Aided Verification
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Conversation protocols: a formalism for specification and verification of reactive electronic services
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2080406 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080411 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1980999 (Why is no real title available?) | 2003-09-15 | Paper |
| scientific article; zbMATH DE number 1836416 (Why is no real title available?) | 2003-05-12 | Paper |
Counter machines and verification problems.
Theoretical Computer Science | 2003-01-21 | Paper |
Augmenting the discrete timed automaton with other data structures.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1759611 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1832320 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1832329 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1773082 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1759429 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1701756 (Why is no real title available?) | 2002-02-05 | Paper |
| scientific article; zbMATH DE number 1670769 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1515857 (Why is no real title available?) | 2000-10-10 | Paper |
| scientific article; zbMATH DE number 1408336 (Why is no real title available?) | 2000-02-29 | Paper |
A technique for proving decidability of containment and equivalence of linear constraint queries
Journal of Computer and System Sciences | 1999-11-23 | Paper |
Support for modeling relationships in object-oriented databases
Data & Knowledge Engineering | 1999-04-28 | Paper |
Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
Journal of Computer and System Sciences | 1999-02-21 | Paper |
Deductive query languages for recursively typed complex objects
The Journal of Logic Programming | 1999-01-11 | Paper |
Queries with arithmetical constraints
Theoretical Computer Science | 1998-07-23 | Paper |
Dynamic constraints and object migration
Theoretical Computer Science | 1998-07-22 | Paper |
Finitely representable databases
Journal of Computer and System Sciences | 1997-12-17 | Paper |
Deterministic FOIES are strictly weaker
Annals of Mathematics and Artificial Intelligence | 1997-10-26 | Paper |
Conjunctive query containment with respect to views and constraints
Information Processing Letters | 1997-02-28 | Paper |
Nonrecursive incremental evaluation of Datalog queries
Annals of Mathematics and Artificial Intelligence | 1996-10-20 | Paper |
Incremental and decremental evaluation of transitive closure by first- order queries
Information and Computation | 1995-09-17 | Paper |
Domain independence and the relational calculus
Acta Informatica | 1994-11-23 | Paper |
Dependency preservation in semantic databases
Acta Informatica | 1994-05-10 | Paper |
Algebraic and calculus query languages for recursively typed complex objects
Journal of Computer and System Sciences | 1993-10-10 | Paper |
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences | 1992-06-25 | Paper |
