Sciweavers

46 search results - page 8 / 10
» Automatic Coding Rule Conformance Checking Using Logic Progr...
Sort
View
151
Voted
PPDP
2010
Springer
15 years 2 months ago
Type inference in intuitionistic linear logic
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
Patrick Baillot, Martin Hofmann
180
Voted
ESOP
2005
Springer
15 years 9 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow
179
Voted
JSC
2010
100views more  JSC 2010»
14 years 10 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
SIGSOFT
2007
ACM
16 years 4 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...
118
Voted
EMSOFT
2006
Springer
15 years 7 months ago
Software partitioning for effective automated unit testing
A key problem for effective unit testing is the difficulty of partitioning large software systems into appropriate units that can be tested in isolation. We present an approach th...
Arindam Chakrabarti, Patrice Godefroid