The following pages link to Patrick Cousot (Q655408):
Displayed 50 items.
- Grammar semantics, analysis and parsing by abstract interpretation (Q655410) (← links)
- Item:Q655408 (redirect page) (← links)
- ``A la Burstall'' intermittent assertions induction principles for proving inevitability properties of programs (Q689297) (← links)
- Why does Astrée scale up? (Q845249) (← links)
- Bi-inductive structural semantics (Q1012127) (← 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)
- A language independent proof of the soundness and completeness of generalized Hoare logic (Q1122978) (← links)
- Constructive versions of Tarski's fixed point theorems (Q1260047) (← links)
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) (← links)
- Parsing as abstract interpretation of grammar semantics (Q1853600) (← links)
- Bi-inductive Structural Semantics (Q2871828) (← links)
- Probabilistic Abstract Interpretation (Q2892727) (← links)
- An abstract interpretation framework for termination (Q2942877) (← links)
- Linear Absolute Value Relation Analysis (Q3000578) (← links)
- The Reduced Product of Abstract Domains and the Combination of Decision Procedures (Q3000629) (← links)
- Precondition Inference from Intermittent Assertions and Application to Contracts on Collections (Q3075478) (← links)
- Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships (Q3392932) (← links)
- An abstract interpretation-based framework for software watermarking (Q3452259) (← links)
- A Scalable Segmented Decision Tree Abstract Domain (Q3587252) (← links)
- Grammar Analysis and Parsing by Abstract Interpretation (Q3593074) (← links)
- Fixpoint-Guided Abstraction Refinements (Q3612008) (← links)
- An Abstract Domain to Discover Interval Linear Equalities (Q3656879) (← links)
- (Q3802590) (← links)
- (Q3871899) (← links)
- (Q3968981) (← links)
- Abstract interpretation and application to logic programs (Q4012706) (← links)
- (Q4174789) (← links)
- (Q4222883) (← links)
- (Q4385541) (← links)
- (Q4414376) (← links)
- (Q4414726) (← links)
- (Q4473711) (← links)
- (Q4536712) (← links)
- Abstract interpretation (Q4635587) (← links)
- (Q4736494) (← links)
- (Q4738384) (← links)
- (Q4738461) (← links)
- (Q4804884) (← links)
- A Case Study in Abstract Interpretation Based Program Transformation (Q4917048) (← links)
- (Q4934630) (← links)
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) (← links)
- Abstracting Induction by Extrapolation and Interpolation (Q5172632) (← links)
- Temporal abstract interpretation (Q5178838) (← links)
- Systematic design of program transformation frameworks by abstract interpretation (Q5178905) (← links)
- Abstract Interpretation Frameworks (Q5285987) (← links)
- Verification: Theory and Practice (Q5305644) (← links)
- Programming Languages and Systems (Q5316581) (← links)
- Ogre and Pythia: an invariance proof method for weak consistency models (Q5370841) (← links)
- Theories, solvers and static analysis by abstract interpretation (Q5395699) (← links)