SC2 challenges: when Satisfiability Checking and Symbolic Computation join forces James H. Davenport, Pascal Fontaine, Alberto Griggio (and the others partners whose details wouldn’t fit)1 University of Bath, LORIA, Fo

Source URL: staff.bath.ac.uk

• Theoretical computer science
• Logic
• Logic in computer science
• Mathematics
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean algebra
• Boolean satisfiability problem
• Uninterpreted function
• Satisfiability
• Solver

Executable Counterexamples in Software Model Checking J. Gennari1 and A. Gurfinkel2 and T. Kahsai3 and J. A. Navas4 and E. J. Schwartz1 Presenter: Natarajan Shankar4 1 Carnegie

Source URL: seahorn.github.io

• Computing
• Computer programming
• C
• Data types
• Pointer
• Hooking
• Exec
• Nm
• Struct

Specifying and Checking File System Crash-Consistency Models James Bornholt Antoine Kaufmann Jialin Li

Source URL: unsat.cs.washington.edu

• Computer architecture
• Computing
• System software
• Disk file systems
• C POSIX library
• System calls
• Application programming interfaces
• Ext4
• Sync
• POSIX
• Ext3
• File system

An Object-Oriented Framework for Explicit-State Model Checking Mark Kattenbelt1 and Theo C. Ruys2 and Arend Rensink2 Abstract. This paper presents a conceptual architecture for an object-oriented framework to support the

Source URL: qav.comlab.ox.ac.uk

• Theoretical computer science
• Formal methods
• Computing
• Mathematics
• Logic in computer science
• Graph rewriting
• Model checking
• Algorithm
• Formal verification
• Abstraction
• Generic programming
• Finite-state machine

Combination Methods for Model-Checking of Infinite-State Systems S. Ghilardi1 , E. Nicolini2 , S. Ranise2 , and D. Zucchelli1,2 1 Università 2 LORIA

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Temporal logic
• Computer science
• Formal methods
• Linear temporal logic
• Model checking
• Amir Pnueli
• French Institute for Research in Computer Science and Automation
• Mathematical logic
• Temporal logic in finite-state verification

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1 Model checking probabilistic and stochastic extensions of the π -calculus

Source URL: qav.comlab.ox.ac.uk

Checking Cache-Coherence Protocols with TLA+ Rajeev Joshi HP Labs, Systems Research Center, Palo Alto, CA. Leslie Lamport Microsoft Research, Mountain View, CA.

Source URL: rjoshi.org

• Computing
• Computer architecture
• Concurrent computing
• Formal methods
• Theoretical computer science
• Cache coherency
• Instruction set architectures
• Concurrency
• TLA+
• Model checking
• Cache coherence
• Specification language

Putting Flight Software Through the Paces with Testing, Model Checking, and Constraint-Solving Alex Groce1 , Gerard Holzmann1 , Rajeev Joshi1 , and Ru-Gang Xu2 1

Source URL: rjoshi.org

• Software testing
• Software engineering
• Model checkers
• Computing
• Theoretical computer science
• Formal methods
• Model checking
• Formal verification
• Random testing
• Test automation
• SPIN model checker
• Acceptance testing

Specifying and Checking File System Crash-Consistency Models James Bornholt Antoine Kaufmann Jialin Li

Source URL: unsat.cs.washington.edu

• Computer architecture
• System software
• Computing
• Disk file systems
• Ext4
• Ext3
• Sync
• File system
• Btrfs
• XFS
• Inode
• File locking

Suggesting Edits to Explain Failing Traces Giles Reger University of Manchester, UK Abstract. Runtime verification involves checking whether an execution trace produced by a running system satisfies a specification. Howe

Source URL: www.cs.man.ac.uk

• Mathematics
• Algebra
• Theoretical computer science
• Finite automata
• Linear algebra
• Finite-state transducer
• Dynamic programming
• Edit distance
• Trace
• Finite-state machine
• Shortest path problem
• Levenshtein distance