Sciweavers

76 search results - page 4 / 16
» Using Datalog and Boolean Equation Systems for Program Analy...
Sort
View
ASAP
1996
IEEE
90views Hardware» more  ASAP 1996»
15 years 1 months ago
Hierarchical Static Analysis Of Structured Systems Of Affine Recurrence Equations
The Alpha language, based on systems of affine recurrence equations over polyhedral domains, allows the expression of complex algorithms as hierarchical, parameterized structures ...
Florent de Dinechin, Sophie Robert
AGP
1994
IEEE
15 years 1 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...
LICS
2008
IEEE
15 years 4 months ago
Nonlocal Flow of Control and Kleene Algebra with Tests
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
Dexter Kozen
HYBRID
2005
Springer
15 years 3 months ago
A Toolbox of Hamilton-Jacobi Solvers for Analysis of Nondeterministic Continuous and Hybrid Systems
Abstract. Hamilton-Jacobi partial differential equations have many applications in the analysis of nondeterministic continuous and hybrid systems. Unfortunately, analytic solution...
Ian M. Mitchell, Jeremy A. Templeton
MICAI
2000
Springer
15 years 1 months ago
Searching for a Solution to Program Verification=Equation Solving in CCS
Unique Fixpoint Induction, UFI, is a chief inference rule to prove the equivalence of recursive processes in CCS [7]. It plays a major role in the equational approach to verificati...
Raul Monroy, Alan Bundy, Ian Green