Pages that link to "Item:Q689297"
From MaRDI portal
The following pages link to ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297):
Displaying 50 items.
- A generic framework for heap and value analyses of object-oriented programming languages (Q278744) (← links)
- Inverse-limit and topological aspects of abstract interpretation (Q418811) (← links)
- Discovering invariants via simple component analysis (Q435979) (← links)
- Abstract interpretation of database query languages (Q456469) (← links)
- Runtime verification of embedded real-time systems (Q479806) (← links)
- Transforming semantics by abstract interpretation (Q557807) (← links)
- Measuring the confinement of probabilistic systems (Q557887) (← links)
- Modular inference of subprogram contracts for safety checking (Q604392) (← links)
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- The algorithmic analysis of hybrid systems (Q673868) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- A new look at the automatic synthesis of linear ranking functions (Q714505) (← links)
- Algebras of modal operators and partial correctness (Q820135) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- 3-valued abstraction: More precision at less cost (Q958307) (← links)
- On the algebraic structure of declarative programming languages (Q1035699) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Abstract interpretation of resolution-based semantics (Q1035705) (← links)
- Sometime = always + recursion \(\equiv\) always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs (Q1071491) (← links)
- Strictness analysis and denotational abstract interpretation (Q1098274) (← links)
- The quotient of an abstract interpretation (Q1128983) (← links)
- Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
- Strictness analysis via abstract interpretation for recursively defined types (Q1193597) (← links)
- A lattice for abstract interpretation of dynamic (LISP-like) structures (Q1201726) (← links)
- The reduced relative power operation on abstract domains (Q1285656) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Abstract domains for type juggling (Q1650957) (← links)
- A global constraint for over-approximation of real-time streams (Q1699526) (← links)
- A monotone framework for CCS (Q1749243) (← links)
- Demand-driven interprocedural analysis for map-based abstract domains (Q1785851) (← links)
- Parsing as abstract interpretation of grammar semantics (Q1853600) (← links)
- An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (Q1853617) (← links)
- On abstract interpretation of mobile ambients (Q1887169) (← links)
- The essence of constraint propagation (Q1960525) (← links)
- The powerset operator on abstract interpretations (Q1960538) (← links)
- Design of abstract domains using first-order logic (Q1960541) (← links)
- Reachability analysis via orthogonal sets of patterns (Q2130568) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Exact join detection for convex polyhedra and other numerical abstractions (Q2269830) (← links)
- Widening and narrowing operators for abstract interpretation (Q2275526) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- A class of polynomially solvable range constraints for interval analysis without widenings (Q2575737) (← links)
- A semantic framework for the abstract model checking of tccp programs (Q2576949) (← links)
- On finite-state approximants for probabilistic computation tree logic (Q2576951) (← links)
- Abstract Interpretation From a Denotational-semantics Perspective (Q2805148) (← links)
- On Probabilistic Techniques for Data Flow Analysis (Q2870284) (← links)
- Bi-inductive Structural Semantics (Q2871828) (← links)
- Verifying Multithreaded Recursive Programs with Integer Variables (Q5179057) (← links)
- What You Lose is What You Leak: Information Leakage in Declassification Policies (Q5262929) (← links)
