DoubleCheck your theorems

Eastlund, Carl

doi:10.1145/1637837.1637844

Cited by 20 publications

(17 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, Bulwahn's tool uses Horn clause data flow analysis to automatically devise generators that only produce data that satisfies the precondition of the tested conjecture (Bulwahn 2012b). Eastlund (2009) implemented DoubleCheck, an adaption of QuickCheck for ACL2. Chamarthi et al (2011) later proposed a more advanced counterexample finding tool for ACL2s, which uses the full power of the theorem prover and libraries to simplify conjectures so that they are easier to falsify.…”

Section: Related Workmentioning

confidence: 99%

Testing noninterference, quickly

Hriţcu¹,

Lampropoulos

Spector-Zabusky

et al. 2016

J. Funct. Prog.

View full text Add to dashboard Cite

Information-flow control mechanisms are difficult both to design and to prove correct. To reduce the time wasted on doomed proof attempts due to broken definitions, we advocate modern random testing techniques for finding counterexamples during the design process. We show how to use QuickCheck, a property-based random-testing tool, to guide the design of increasingly complex information-flow abstract machines, leading up to a sophisticated register machine with a novel and highly permissive flow-sensitive dynamic enforcement mechanism that is sound in the presence of first-class public labels. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important for efficient testing. We propose several approaches and evaluate their effectiveness on a collection of injected bugs of varying subtlety. We also present an effective technique for shrinking large counterexamples to minimal, easily comprehensible ones. Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for more than 45 bugs. Moreover, we show how testing guides the discovery of the sophisticated invariants needed for the noninterference proof of our most complex machine.

show abstract

Section: Related Workmentioning

confidence: 99%

Testing noninterference, quickly

Hriţcu¹,

Lampropoulos

Spector-Zabusky

et al. 2016

J. Funct. Prog.

View full text Add to dashboard Cite

show abstract

“…Moreover, Bulwahn's tool uses Horn clause data flow analysis to automatically devise generators that only produce data that satisfies the precondition of the tested conjecture [6]. Eastlund [11] implemented DoubleCheck, an adaption of QuickCheck for ACL2. Chamarthi et al [20] later proposed a more advanced counterexample finding tool for ACL2s, which uses the full power of the theorem prover and libraries to simplify conjectures so that they are easier to falsify.…”

Section: Related Workmentioning

confidence: 99%

Testing noninterference, quickly

et al. 2013

View full text Add to dashboard Cite

Information-flow control mechanisms are difficult to design and labor intensive to prove correct. To reduce the time wasted on proof attempts doomed to fail due to broken definitions, we advocate modern random testing techniques for finding counterexamples during the design process. We show how to use QuickCheck, a property-based random-testing tool, to guide the design of a simple information-flow abstract machine. We find that both sophisticated strategies for generating well-distributed random programs and readily falsifiable formulations of noninterference properties are critically important. We propose several approaches and evaluate their effectiveness on a collection of injected bugs of varying subtlety. We also present an effective technique for shrinking large counterexamples to minimal, easily comprehensible ones. Taken together, our best methods enable us to quickly and automatically generate simple counterexamples for all these bugs.

show abstract

“…Last but not least, because the event handlers are just functions, we can also subject them to the functional random testing (Claessen and Hughes 2000) tools now built into DrScheme or its theorem proving environment (Eastlund 2009). Indeed, programmers who learn to formulate conjectures and validate conjectures via random testing are ideally prepared to study the automated verification of interactive/reactive programs.…”

Section: Design Recipementioning

confidence: 99%

“…When the theorem prover fails, students are encouraged to subject their conjectures to our ACL2 random tester (Eastlund 2009). …”

Section: Reasoning About Worlds and Universesmentioning

confidence: 99%

A functional I/O system or, fun for freshman kids

et al. 2009

View full text Add to dashboard Cite

Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10-14). After all, functional programming is a form of algebra and programming is a creative activity about problem solving. Introducing it into mathematics courses would make pre-algebra course come alive. If input and output were invisible, students could implement fun simulations, animations, and even interactive and distributed games all while using nothing more than plain mathematics.We have implemented this vision with a simple framework for purely functional I/O. Using this framework, students design, implement, and test plain mathematical functions over numbers, booleans, string, and images. Then the framework wires them up to devices and performs all the translation from external information to internal data (and vice versa)-just like every other operating system. Once middle school students are hooked on this form of programming, our curriculum provides a smooth path for them from pre-algebra to freshman courses in college on object-oriented design and theorem proving.

show abstract

DoubleCheck your theorems

Cited by 20 publications

References 5 publications

Testing noninterference, quickly

Testing noninterference, quickly

Testing noninterference, quickly

A functional I/O system or, fun for freshman kids

Contact Info

Product

Resources

About