| The Complexity of LTL Rational Synthesis
|
2022 |
Kupferman, Orna |
| ZDD Boolean Synthesis
|
2022 |
Lin, Yi |
| Verifying Fortran Programs with CIVL
|
2022 |
Wu, Wenhao |
| Efficient Neural Network Analysis with Sum-of-Infeasibilities
|
2022 |
Wu, Haoze |
| A Max-SMT Superoptimizer for EVM handling Memory and Storage
|
2022 |
Albert, Elvira |
| LinSyn: Synthesizing Tight Linear Bounds for Arbitrary Neural Network Activation Functions
|
2022 |
Paulsen, Brandon |
| cvc5: A Versatile and Industrial-Strength SMT Solver
|
2022 |
Barbosa, Haniel |
| NORMA: a tool for the analysis of Relay-based Railway Interlocking Systems
|
2022 |
Amendola, Arturo |
| A New Approach for Active Automata Leaming Based on Apartness
|
2022 |
Vaandrager, Frits |
| NeuReach: Learning Reachability Functions from Simulations
|
2022 |
Sun, Dawei |
| A Sorted Datalog Hammer for Supervisor Verification Conditions Modulo Simple Linear Arithmetic
|
2022 |
Bromberger, Martin |
| Moving Definition Variables in Quantified Boolean Formulas
|
2022 |
Reeves, Joseph E. |
| Transition Power Abstractions for Deep Counterexample Detection
|
2022 |
Blicha, Martin |
| Synthesis of Compact Strategies for Coordination Programs
|
2022 |
Namjoshi, Kedar S. |
| Fast and Reliable Formal Verification of Smart Contracts with the Move Prover
|
2022 |
Dill, David |
| Formal Verification of the Ethereum 2.0 Beacon Chain
|
2022 |
Cassez, Franck |
| Leaming Realtime One-Counter Automata
|
2022 |
Bruyére, Veronique |
| Leaming Model Checking and the Kernel Trick for Signal Temporal Logic on Stochastic Processes
|
2022 |
Bortolussi, Luca |
| Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
|
2022 |
Raha, Ritam |
| Inferring Interval-Valued Floating-Point Preconditions
|
2022 |
Krämer, Jonas |
Tag hinzufügen