Approximate Synchrony: An Abstraction for Distributed Almost-Synchronous Systems
Abstract elided by the publisher.
2,069 papers · page 40 of 104
Quantifying Conformance Using the Skorokhod Metric
Abstract elided by the publisher.
Fairness Modulo Theory: A New Approach to LTL Software Model Checking
Abstract elided by the publisher.
Meeting a Powertrain Verification Challenge
Abstract elided by the publisher.
Model Checking Parameterized Asynchronous Shared-Memory Systems
Abstract elided by the publisher.
Finding Bounded Path in Graph Using SMT for Automatic Clock Routing
Abstract elided by the publisher.
Measuring with Timed Patterns
Abstract elided by the publisher.
Adam: Causality-Based Synthesis of Distributed Systems
Abstract elided by the publisher.
Algorithms for Model Checking HyperLTL and HyperCTL ^*
Abstract elided by the publisher.
Synthesising Executable Gene Regulatory Networks from Single-Cell Gene Expression Data
Recent experimental advances in biology allow researchers to obtain gene expression profiles at single-cell resolution over hundreds, or even thousands of cells at once. These single-cell measurements provide snapshots of the states of the cells that make up a tissue, instead of …
A Trusted Mechanised Specification of JavaScript: One Year On
Abstract elided by the publisher.
Learning Commutativity Specifications
Abstract elided by the publisher.
Symbolic Polytopes for Quantitative Interpolation and Verification
Abstract elided by the publisher.
OpenJDK's Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case
Abstract elided by the publisher.
Tree Buffers
In runtime verification, the central problem is to decide if a given program execution violates a given property. In online runtime verification, a monitor observes a program's execution as it happens. If the program being observed has hard real-time constraints, then the monitor…
The SeaHorn Verification Framework
Abstract elided by the publisher.
Automated and Modular Refinement Reasoning for Concurrent Programs
Abstract elided by the publisher.
The Open-Source LearnLib - A Framework for Active Automata Learning
Abstract elided by the publisher.
Skipping Refinement
We introduce skipping refinement, a new notion of correctness for reasoning about optimized reactive systems. Reasoning about reactive systems using refinement involves defining an abstract, highlevel specification system and a concrete, low-level implementation system. One then …
Adaptive Concretization for Parallel Program Synthesis
Program synthesis tools work by searching for an implementation that satisfies a given specification. Two popular search strategies are symbolic search, which reduces synthesis to a formula passed to a SAT solver, and explicit search, which uses brute force or random search to fi…