A generalization of the differential approach to recursive query evaluation
Journal of Logic Programming
Skolem normal forms concerning the least fixpoint
Computation theory and logic
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Symbolic finite differencing, part I (invited lecture)
Proceedings of the third European symposium on programming on ESOP '90
Optimizing bottom-up query evaluation for deductive databases
Optimizing bottom-up query evaluation for deductive databases
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to set constraint-based program analysis
Science of Computer Programming
A faster solver for general systems of equations
Science of Computer Programming
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
The Definition of Standard ML
Principles of Program Analysis
Principles of Program Analysis
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Faster SAT and smaller BDDs via common function structure
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems
Nordic Journal of Computing
ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
A Universal Top-Down Fixpoint Algorithm
A Universal Top-Down Fixpoint Algorithm
Static validation of security protocols
Journal of Computer Security
Heuristics for Safety and Security Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Control Flow Analysis for BioAmbients
Electronic Notes in Theoretical Computer Science (ENTCS)
Relational Analysis of Correlation
SAS '08 Proceedings of the 15th international symposium on Static Analysis
A Formal Analysis of Complex Type Flaw Attacks on Security Protocols
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
From generic to specific: off-line optimization for a general constraint solver
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
A Scalable Inclusion Constraint Solver Using Unification
Logic-Based Program Synthesis and Transformation
Type Inference for Correspondence Types
Electronic Notes in Theoretical Computer Science (ENTCS)
Securing Statically-verified Communications Protocols Against Timing Attacks
Electronic Notes in Theoretical Computer Science (ENTCS)
From Flow Logic to static type systems for coordination languages
Science of Computer Programming
A formal analysis for capturing replay attacks in cryptographic protocols
ASIAN'07 Proceedings of the 12th Asian computing science conference on Advances in computer science: computer and network security
From flow logic to static type systems for coordination languages
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Relational analysis for delivery of services
TGC'07 Proceedings of the 3rd conference on Trustworthy global computing
Detecting and preventing type flaws at static time
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Types from control flow analysis
Program analysis and compilation, theory and practice
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated analysis of infinite scenarios
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
Galois connections for flow algebras
FMOODS'11/FORTE'11 Proceedings of the joint 13th IFIP WG 6.1 and 30th IFIP WG 6.1 international conference on Formal techniques for distributed systems
Automated verification of virtualized infrastructures
Proceedings of the 3rd ACM workshop on Cloud computing security workshop
Flow Logic for Process Calculi
ACM Computing Surveys (CSUR)
Information flow analysis for VHDL
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
Analyzing security protocols in hierarchical networks
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Model checking Is static analysis of modal logic
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Type-Based enforcement of secure programming guidelines -- code injection prevention at SAP
FAST'11 Proceedings of the 8th international conference on Formal Aspects of Security and Trust
Model checking as static analysis: revisited
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Proceedings of the 14th symposium on Principles and practice of declarative programming
| Hi-index | 0.00 |
We develop a solver algorithm which allows to efficiently compute the stable model of a very expressive fragment of predicate logic. The succinct formulation of the algorithm is due to the disciplined use of continuations and memoisation. This facilitates giving a precise characterisation of the behaviour of the solver and to develop a complexity calculation which allows to obtain its formal complexity. Practical experiments on a control-flow analysis of the ambient calculus show that the solver frequently performs better than the worst-case complexity estimates.