A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Abstract interpretation and application to logic programs
Journal of Logic Programming
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A formally verified algorithm for clock synchronization under a hybrid fault model
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Approximations for verifying timing properties
Theories and experiences for real-time system development
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Synchronous Programming of Reactive Systems
Synchronous Programming of Reactive Systems
Synchronous Observers and the Verification of Reactive Systems
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
PLILP '92 Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming
Operational and Compositional Semantics of Synchronous Automaton Compositions
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Integration Graphs: A Class of Decidable Hybrid Systems
Hybrid Systems
Delay Analysis in Synchronous Programs
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Verification of Real-Time Systems by Successive Over and Under Approximation
Proceedings of the 7th International Conference on Computer Aided Verification
Proceedings of the Real-Time: Theory in Practice, REX Workshop
An Old-Fashioned Recipe for Real Time
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Directions for research in approximate system analysis
ACM Computing Surveys (CSUR)
Higher-Order and Symbolic Computation
Efficient Real-Time Model Checking Using Tabled Logic Programming and Constraints
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Deriving Pre-conditions for Array Bound Check Elimination
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
An Algebraic Framework for Abstract Model Checking
Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
Validation of Synchronous Reactive Systems: From Formal Verification to Automatic Testing
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
SAT-Based Verification without State Space Traversal
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On Proving Safety Properties by Integrating Static Analysis, Theorem Proving and Abstraction
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Accurate Widenings and Boundedness Properties of Timed Systems
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Dynamic Partitioning in Analyses of Numerical Properties
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Cleanness Checking of String Manipulations in C Programs via Integer Analysis
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Verification Using Test Generation Techniques
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
DS '00 Proceedings of the Third International Conference on Discovery Science
An Approach to Symbolic Test Generation
IFM '00 Proceedings of the Second International Conference on Integrated Formal Methods
Extending sized type with collection analysis
Proceedings of the 2003 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
CSSV: towards a realistic tool for statically detecting all buffer overflows in C
PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Formal Methods in System Design
Constraint-Based Verification of Parameterized Cache Coherence Protocols
Formal Methods in System Design
Verification of timed circuits with symbolic delays
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
A framework for numeric analysis of array operations
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
Translating discrete-time simulink to lustre
ACM Transactions on Embedded Computing Systems (TECS)
Precise widening operators for convex polyhedra
Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Some ways to reduce the space dimension in polyhedra computations
Formal Methods in System Design
EPspectra: a formal toolkit for developing DSP software applications
Theory and Practice of Logic Programming
Polynomial approximations of the relational semantics of imperative programs
Science of Computer Programming
The octahedron abstract domain
Science of Computer Programming
Constructing invariants for hybrid systems
Formal Methods in System Design
Verification of Concurrent Systems with Parametric Delays Using Octahedra
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
Inferring Min and Max Invariants Using Max-Plus Polyhedra
SAS '08 Proceedings of the 15th international symposium on Static Analysis
SLR: Path-Sensitive Analysis through Infeasible-Path Detection and Syntactic Language Refinement
SAS '08 Proceedings of the 15th international symposium on Static Analysis
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Model checking sequential software programs via mixed symbolic analysis
ACM Transactions on Design Automation of Electronic Systems (TODAES)
SPEED: precise and efficient static estimation of program computational complexity
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Control-flow refinement and progress invariants for bound analysis
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
WISE: Automated test generation for worst-case complexity
ICSE '09 Proceedings of the 31st International Conference on Software Engineering
SPEED: Symbolic Complexity Bound Analysis
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Generating and Analyzing Symbolic Traces of Simulink/Stateflow Models
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Theoretical Computer Science
Refining the control structure of loops using static analysis
EMSOFT '09 Proceedings of the seventh ACM international conference on Embedded software
The convex hull of a regular set of integer vectors is polyhedral and effectively computable
Information Processing Letters
Weakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness
Formal Methods in System Design
Combining control and data abstraction in the verification of hybrid systems
MEMOCODE'09 Proceedings of the 7th IEEE/ACM international conference on Formal Methods and Models for Codesign
WYSINWYX: What you see is not what you eXecute
ACM Transactions on Programming Languages and Systems (TOPLAS)
Precise widening operators for convex polyhedra
SAS'03 Proceedings of the 10th international conference on Static analysis
Cartesian factoring of polyhedra in linear relation analysis
SAS'03 Proceedings of the 10th international conference on Static analysis
Using counterexamples for improving the precision of reachability computation with polyhedra
CAV'07 Proceedings of the 19th international conference on Computer aided verification
From model-checking to temporal logic constraint solving
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Symbolic model checking of hybrid systems using template polyhedra
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Automatically refining abstract interpretations
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
Some Experience on the Software Engineering of Abstract Interpretation Tools
Electronic Notes in Theoretical Computer Science (ENTCS)
A Modular Static Analysis Approach to Affine Loop Invariants Detection
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Fixpoint Computations with Numerical Acceleration Methods
Electronic Notes in Theoretical Computer Science (ENTCS)
Static Analysis by Abstract Interpretation: A Mathematical Programming Approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs
Electronic Notes in Theoretical Computer Science (ENTCS)
Combining control and data abstraction in the verification of hybrid systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Tabled resolution + constraints: a recipe for model checking real-time systems
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Running-modes of real-time systems: a case-study with mode-automata
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Simple and precise widenings for H-polyhedra
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Linear absolute value relation analysis
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Generalizing the template polyhedral domain
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Static run-time mode extraction by state partitioning in synchronous process networks
Proceedings of the 14th International Workshop on Software and Compilers for Embedded Systems
Decentralized Control of Infinite Systems
Discrete Event Dynamic Systems
Relational abstractions for continuous and hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
The two variable per inequality abstract domain
Higher-Order and Symbolic Computation
Policy iteration within logico-numerical abstract domains
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Widening with thresholds for programs with complex control graphs
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Static analysis in disjunctive numerical domains
SAS'06 Proceedings of the 13th international conference on Static Analysis
Combining widening and acceleration in linear relation analysis
SAS'06 Proceedings of the 13th international conference on Static Analysis
Fixed point iteration for computing the time elapse operator
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Scalable analysis of linear systems using mathematical programming
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Symbolic test selection based on approximate analysis
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Derivation of non-structural invariants of petri nets using abstract interpretation
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Efficient strongly relational polyhedral analysis
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Widening operators for weakly-relational numeric abstractions
SAS'05 Proceedings of the 12th international conference on Static Analysis
Quantifier elimination for quartics
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Widening polyhedra with landmarks
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
From hybrid data-flow languages to hybrid automata: a complete translation
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Discrete Event Dynamic Systems
Argos: an automaton-based synchronous language
Computer Languages
Acceleration of the abstract fixpoint computation in numerical program analysis
Journal of Symbolic Computation
Applying abstract acceleration to (co-)reachability analysis of reactive programs
Journal of Symbolic Computation
Static analysis of run-time modes in synchronous process network
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Timed relational abstractions for sampled data control systems
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Verification of Concurrent Systems with Parametric Delays Using Octahedra
Fundamenta Informaticae - The Fourth Special Issue on Applications of Concurrency to System Design (ACSD05)
SAS'07 Proceedings of the 14th international conference on Static Analysis
Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach
Electronic Notes in Theoretical Computer Science (ENTCS)
Stratified Static Analysis Based on Variable Dependencies
Electronic Notes in Theoretical Computer Science (ENTCS)
Model-Based static code analysis for MATLAB models
ISoLA'12 Proceedings of the 5th international conference on Leveraging Applications of Formal Methods, Verification and Validation: technologies for mastering change - Volume Part I
When the decreasing sequence fails
SAS'12 Proceedings of the 19th international conference on Static Analysis
SAS'12 Proceedings of the 19th international conference on Static Analysis
Verifying programs via iterated specialization
PEPM '13 Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation
Tracking differentiable trajectories across polyhedra boundaries
Proceedings of the 16th international conference on Hybrid systems: computation and control
Proceedings of the 2013 International Conference on Software Engineering
Automatic synthesis of switching controllers for linear hybrid systems: Safety control
Theoretical Computer Science
| Hi-index | 0.01 |
Linear Relation Analysis [11] is an abstract interpretation devotedto the automatic discovery of invariant linear inequalities amongnumerical variables of a program. In this paper, we apply such ananalysis to the verification of quantitative time properties of twokinds of systems: synchronous programs and linear hybrid systems.