Sciweavers

1304 search results - page 78 / 261
» Model Checking C Programs Using F-SOFT
Sort
View
POPL
2010
ACM
16 years 11 hour ago
Contracts Made Manifest
Since Findler and Felleisen [2002] introduced higher-order contracts, many variants have been proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in u...
Benjamin C. Pierce, Michael Greenberg, Stephanie W...
ESOP
2003
Springer
15 years 7 months ago
Modeling Web Interactions
Programmers confront a minefield when they design interactive Web programs. Web interactions take place via Web browsers. With browsers, consumers can whimsically navigate among t...
Paul T. Graunke, Robert Bruce Findler, Shriram Kri...
127
Voted
STOC
1998
ACM
135views Algorithms» more  STOC 1998»
15 years 6 months ago
Checking Polynomial Identities over any Field: Towards a Derandomization?
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
Daniel Lewin, Salil P. Vadhan
143
Voted
SAS
2005
Springer
134views Formal Methods» more  SAS 2005»
15 years 8 months ago
Using Dependent Types to Certify the Safety of Assembly Code
There are many source-level analyses or instrumentation tools that enforce various safety properties. In this paper we present an infrastructure that can be used to check independe...
Matthew Harren, George C. Necula
93
Voted
FASE
2010
Springer
15 years 6 months ago
Efficient Runtime Assertion Checking of Assignable Clauses with Datagroups
Runtime assertion checking is useful for debugging programs and specifications. Existing tools check invariants as well as method preand postconditions, but mostly ignore assignabl...
Hermann Lehner, Peter Müller