The following pages link to FAST (Q33078):
Displaying 42 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Guiding Craig interpolation with domain-specific abstractions (Q300418) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Applying abstract acceleration to (co-)reachability analysis of reactive programs (Q435977) (← links)
- Programs with lists are counter automata (Q537953) (← links)
- Quantitative separation logic and programs with lists (Q707740) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- On the completeness of bounded model checking for threshold-based distributed algorithms: reachability (Q729813) (← links)
- Formal verification of real-time systems with preemptive scheduling (Q844238) (← links)
- Some ways to reduce the space dimension in polyhedra computations (Q853727) (← links)
- Verification of qualitative \(\mathbb Z\) constraints (Q959820) (← links)
- Verification and falsification of programs with loops using predicate abstraction (Q968302) (← links)
- Don't care words with an application to the automata-based approach for real addition (Q1028730) (← links)
- The convex hull of a regular set of integer vectors is polyhedral and effectively computable (Q1044697) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- \(\text{Para}^2\): parameterized path reduction, acceleration, and SMT for reachability in threshold-guarded distributed algorithms (Q1696580) (← links)
- Dense-choice counter machines revisited (Q2015129) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- Structural Presburger digit vector automata (Q2378536) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS (Q2581762) (← links)
- Abstract Fixpoint Computations with Numerical Acceleration Methods (Q2814099) (← links)
- Extending Abstract Acceleration Methods to Data-Flow Programs with Numerical Inputs (Q2814110) (← links)
- Generalizing the Template Polyhedral Domain (Q3000579) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Fair Termination for Parameterized Probabilistic Concurrent Systems (Q3303911) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- Reachability in Parameterized Systems: All Flavors of Threshold Automata (Q5009433) (← links)
- (Q5028423) (← links)
- (Q5028474) (← links)
- A Calculus for Modular Loop Acceleration (Q5039502) (← links)
- (Q5129947) (← links)
- Automatic Verification of Bossa Scheduler Properties (Q5178992) (← links)
- Automatic Verification of Counter Systems With Ranking Function (Q5179052) (← links)
- Reachability in Timed Counter Systems (Q5179060) (← links)
- Experimenting Formal Proofs of Petri Nets Refinements (Q5403468) (← links)
- Automated Technology for Verification and Analysis (Q5491889) (← links)
- The Power of Hybrid Acceleration (Q5756730) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
- A case study on parametric verification of failure detectors (Q5883746) (← links)
- Abstraction refinement and antichains for trace inclusion of infinite state systems (Q5919079) (← links)
