Sciweavers

1411 search results - page 90 / 283
» Interactive Coding for Interactive Proofs
Sort
View
TYPES
1998
Springer
15 years 4 months ago
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
Thomas Kleymann
101
Voted
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
15 years 4 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
83
Voted
ICSE
2001
IEEE-ACM
15 years 5 months ago
Architecture-Oriented Programming Using FRED
Implementing application-specific code conforming to architectural rules and conventions can be tedious. FRED is a tool prototype for architecture-oriented programming that takes ...
Markku Hakala, Juha Hautamäki, Kai Koskimies,...
ICSM
2009
IEEE
15 years 7 months ago
BCC: Enhancing code completion for better API usability
Nowadays, programmers spend much of their workday dealing with code libraries and frameworks that are bloated with APIs. One common way of interacting with APIs is through Code Co...
David M. Pletcher, Daqing Hou
SCAM
2008
IEEE
15 years 7 months ago
Some Assembly Required - Program Analysis of Embedded System Code
Programming embedded system software typically involves more than one programming language. Normally, a high-level language such as C/C++ is used for application oriented tasks an...
Ansgar Fehnker, Ralf Huuck, Felix Rauch, Sean Seef...