Sciweavers

1226 search results - page 107 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
KBSE
2005
IEEE
15 years 9 months ago
Prufrock: a framework for constructing polytypic theorem provers
Current formal software engineering methodologies provide a vast array of languages for specifying correctness properties, as well as a wide assortment automated tools that aid in...
Justin Ward, Garrin Kimmell, Perry Alexander
243
Voted
POPL
2006
ACM
16 years 3 months ago
Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
Steve Bishop, Matthew Fairbairn, Michael Norrish, ...
CSFW
2008
IEEE
15 years 10 months ago
Language Based Secure Communication
Secure communication in distributed systems is notoriously hard to achieve due to the variety of attacks an adversary can mount, based on message interception, modification, redi...
Michele Bugliesi, Riccardo Focardi
ICPP
1995
IEEE
15 years 7 months ago
Progress: A Toolkit for Interactive Program Steering
Interactive program steering permits researchers to monitor and guide their applications during runtime. Interactive steering can help make end users more effective in addressing ...
Jeffrey S. Vetter, Karsten Schwan
IFIP
2004
Springer
15 years 8 months ago
Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
Chung-Chih Li