Sciweavers

718 search results - page 42 / 144
» Extraction of Structured Programs from Specification Proofs
Sort
View
ESOP
2007
Springer
14 years 18 days ago
A Certified Lightweight Non-interference Java Bytecode Verifier
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
Gilles Barthe, David Pichardie, Tamara Rezk
IJCSA
2007
91views more  IJCSA 2007»
13 years 8 months ago
Experiences in Testing Automation of a Family of Functional- and GUI-similar Programs
This article presents experiences in the automation of a testing process. The main goal is the unified testing of not only one program, but a whole family of programs. The family ...
Anna Derezinska, Tomasz Malek
ACL
2008
13 years 10 months ago
Evolving New Lexical Association Measures Using Genetic Programming
Automatic extraction of collocations from large corpora has been the focus of many research efforts. Most approaches concentrate on improving and combining known lexical associati...
Jan Snajder, Bojana Dalbelo Basic, Sasa Petrovic, ...
AC
2002
Springer
13 years 8 months ago
A Programming Approach to the Design of Asynchronous Logic Blocks
Abstract. Delay-Insensitive Sequential Processes is a structured, parallel programming language. It facilitates the clear, succinct and precise specification of the way an asynchro...
Mark B. Josephs, Dennis P. Furey
LREC
2010
176views Education» more  LREC 2010»
13 years 10 months ago
LAF/GrAF-grounded Representation of Dependency Structures
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that ther...
Yoshihiko Hayashi, Thierry Declerck, Chiharu Naraw...