33 citations · 49 across the 11 of their papers we have counts for
12 papers
Synthesis of Infinite-State Systems with Random Behavior
Andreas Katis, Grigory Fedyukovich, Jeffrey Chen +3
Diversity in the exhibited behavior of a given system is a desirable characteristic in a variety of application contexts. Synthesis of conformant implementations often proceeds by…
The JKind Model Checker
Andrew Gacek, John Backes, Mike Whalen +2
JKind is an open-source industrial model checker developed by Rockwell Collins and the University of Minnesota. JKind uses multiple parallel engines to prove or falsify safety prop…
Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
Andreas Katis, Grigory Fedyukovich, Huajun Guo +4
Automated synthesis of reactive systems from specifications has been a topic of research for decades. Recently, a variety of approaches have been proposed to extend synthesis of re…
Synthesis from Assume-Guarantee Contracts using Skolemized Proofs of Realizability
Andreas Katis, Grigory Fedyukovich, Andrew Gacek +3
The realizability problem in requirements engineering is to determine the existence of an implementation that meets the given formal requirements. A step forward after realizabilit…
On Implementing Real-time Specification Patterns Using Observers
John D. Backes, Michael W. Whalen, Andrew Gacek +1
English language requirements are often used to specify the behavior of complex cyber-physical systems. The process of transforming these requirements to a formal specification lan…
Reasoning about Algebraic Data Types with Abstractions
Tuan-Hung Pham, Andrew Gacek, Michael W. Whalen
Reasoning about functions that operate over algebraic data types is an important problem for a large variety of applications. One application of particular interest is network appl…
Efficient Generation of Inductive Validity Cores for Safety Properties
Elaheh Ghassabani, Andrew Gacek, Michael W. Whalen
Symbolic model checkers can construct proofs of properties over very complex models. However, the results reported by the tool when a proof succeeds do not generally provide much i…
Towards Synthesis from Assume-Guarantee Contracts involving Infinite Theories: A Preliminary Report
Andreas Katis, Michael W. Whalen, Andrew Gacek
In previous work, we have introduced a contract-based real- izability checking algorithm for assume-guarantee contracts involving infinite theories, such as linear integer/real ari…
Requirements Analysis of a Quad-Redundant Flight Control System
John Backes, Darren Cofer, Steven Miller +1
In this paper we detail our effort to formalize and prove requirements for the Quad-redundant Flight Control System (QFCS) within NASA's Transport Class Model (TCM). We use a compo…
Towards Realizability Checking of Contracts using Theories
Andrew Gacek, Andreas Katis, Michael W. Whalen +2
Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quali…
Machine-Checked Proofs For Realizability Checking Algorithms
Andreas Katis, Andrew Gacek, Michael W. Whalen
Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quali…
Resolute: An Assurance Case Language for Architecture Models
Andrew Gacek, John Backes, Darren Cofer +2
Arguments about the safety, security, and correctness of a complex system are often made in the form of an assurance case. An assurance case is a structured argument, often represe…