Sciweavers

658 search results - page 130 / 132
» A formal approach to object-oriented software engineering
Sort
View
POPL
1998
ACM
15 years 1 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
110
Voted
POPL
2011
ACM
14 years 8 days ago
Making prophecies with decision predicates
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
Byron Cook, Eric Koskinen
WWW
2004
ACM
15 years 10 months ago
Meteor-s web service annotation framework
The World Wide Web is emerging not only as an infrastructure for data, but also for a broader variety of resources that are increasingly being made available as Web services. Rele...
Abhijit A. Patil, Swapna A. Oundhakar, Amit P. She...
ICFP
2009
ACM
15 years 10 months ago
Effective interactive proofs for higher-order imperative programs
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
Adam J. Chlipala, J. Gregory Malecha, Greg Morrise...
ACSAC
2001
IEEE
15 years 1 months ago
Practical Automated Filter Generation to Explicitly Enforce Implicit Input Assumptions
Vulnerabilities in distributed applications are being uncovered and exploited faster than software engineers can patch the security holes. All too often these weaknesses result fr...
Valentin Razmov, Daniel R. Simon