Sciweavers

1356 search results - page 4 / 272
» The ideal of verified software
Sort
View
TPHOL
2008
IEEE
14 years 5 months ago
Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL
Slicing is a widely-used technique with applications in e.g. compiler technology and software security. Thus verification of algorithms in these areas is often based on the correc...
Daniel Wasserrab, Andreas Lochbihler
APAL
2011
13 years 5 months ago
Upper bounds on ideals in the computably enumerable Turing degrees
We study ideals in the computably enumerable Turing degrees, and their upper bounds. Every proper Σ0 4 ideal in the c.e. Turing degrees has an incomplete upper bound. It follows t...
George Barmpalias, André Nies
HYBRID
2010
Springer
14 years 5 months ago
Automatic invariant generation for hybrid systems using ideal fixed points
We present computational techniques for automatically generating algebraic (polynomial equality) invariants for algebraic hybrid systems. Such systems involve ordinary differentia...
Sriram Sankaranarayanan
AGILEDC
2009
IEEE
14 years 5 months ago
From Anarchy to Sustainable Development: Scrum in Less than Ideal Conditions
In early 2008, Pyxis Technologies was contracted in the third of a series of projects distributed between Canada and France. This project dwarfed its predecessors in scope and com...
Isabelle Therrien, Erik LeBel
FOSSACS
2005
Springer
14 years 4 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz