Sciweavers

1023 search results - page 65 / 205
» A Formal Method for Program Slicing
Sort
View
SAS
2004
Springer
132views Formal Methods» more  SAS 2004»
14 years 2 months ago
Modular and Constraint-Based Information Flow Inference for an Object-Oriented Language
Abstract. This paper addresses the problem of checking programs written in an object-oriented language to ensure that they satisfy the information flow policies, confidentiality ...
Qi Sun, Anindya Banerjee, David A. Naumann
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 6 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
POPL
2003
ACM
14 years 9 months ago
The essence of XML
The World-Wide Web Consortium (W3C) promotes XML and related standards, including XML Schema, XQuery, and XPath. This paper describes a formalization XML Schema. A formal semantic...
Jérôme Siméon, Philip Wadler
FMCO
2007
Springer
14 years 2 months ago
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode
This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (...
Elvira Albert, Puri Arenas, Samir Genaim, German P...
FMCAD
2008
Springer
13 years 10 months ago
Mechanized Information Flow Analysis through Inductive Assertions
We present a method for verifying information flow properties of software programs using inductive assertions and theorem proving. Given a program annotated with information flow a...
Warren A. Hunt Jr., Robert Bellarmine Krug, Sandip...