| Publication | Date of Publication | Type |
|---|
Termination of simply moded logic programs with dynamic scheduling
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Transforming processes to check and ensure information flow security
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
A proof system for information flow security
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Theoretical Foundations and Semantics of Logic Programming
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Information flow security and recursive systems.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
S-semantics for logic programming: a retrospective look
Theoretical Computer Science | 2009-11-04 | Paper |
Action Refinement in Process Algebra and Security Issues
Logic-Based Program Synthesis and Transformation | 2009-01-22 | Paper |
Unwinding Conditions for Security in Imperative Languages
Logic Based Program Synthesis and Transformation | 2008-04-24 | Paper |
Program Development in Computational Logic
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Verifying persistent security properties
Computer Languages, Systems & Structures | 2004-11-18 | Paper |
On modular termination proofs of general logic programs
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
Properties of Input-Consuming Derivations
Theory and Practice of Logic Programming | 2004-03-01 | Paper |
| scientific article; zbMATH DE number 1953033 (Why is no real title available?) | 2003-07-25 | Paper |
| scientific article; zbMATH DE number 1926606 (Why is no real title available?) | 2003-06-11 | Paper |
| scientific article; zbMATH DE number 1761900 (Why is no real title available?) | 2002-07-01 | Paper |
Semantics of well-moded input consuming logic programs
Computer Languages | 2002-03-19 | Paper |
| scientific article; zbMATH DE number 1696796 (Why is no real title available?) | 2002-01-28 | Paper |
| scientific article; zbMATH DE number 1692954 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1638665 (Why is no real title available?) | 2001-08-29 | Paper |
| scientific article; zbMATH DE number 1615257 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1497819 (Why is no real title available?) | 2001-03-05 | Paper |
| scientific article; zbMATH DE number 1508926 (Why is no real title available?) | 2000-09-18 | Paper |
The s-semantics approach: Theory and applications
The Journal of Logic Programming | 2000-08-14 | Paper |
Termination of well-moded programs
The Journal of Logic Programming | 1999-07-20 | Paper |
| scientific article; zbMATH DE number 970714 (Why is no real title available?) | 1997-03-19 | Paper |
Differential logic programs: Programming methodologies and semantics
Science of Computer Programming | 1996-12-08 | Paper |
Simultaneous Replacement in Normal Programs
Journal Of Logic And Computation | 1996-03-17 | Paper |
A compositional semantics for logic programs
Theoretical Computer Science | 1994-11-29 | Paper |
Norms on terms and their use in proving universal termination of a logic program
Theoretical Computer Science | 1994-04-05 | Paper |
Basic transformation operations which preserve computed answer substitutions of logic programs
The Journal of Logic Programming | 1994-01-13 | Paper |
An intuitionistic theory of types with assumptions of high-arity variables
Annals of Pure and Applied Logic | 1992-09-27 | Paper |
Using FP as a query language for relational data-bases
Computer Languages | 1984-01-01 | Paper |
A divide-and-conquer approach to general context-free parsing
Information Processing Letters | 1983-01-01 | Paper |
