Sciweavers

6794 search results - page 359 / 1359
» Semantics of Visual Languages
Sort
View
KBSE
1997
IEEE
15 years 11 months ago
A Formal Automated Approach for Reverse Engineering Programs with Pointers
Given a program S and a precondition Q, the strongest postcondition, denoted sp(S Q), is defined as the strongest condition that holds after the execution of S, given that S term...
Gerald C. Gannod, Betty H. C. Cheng
COMPASS
1994
15 years 10 months ago
Types, Subtypes, and ASL+
ASL+ is a formalism for speci cation and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and re nement of speci cations, whic...
David Aspinall
ESOP
2009
Springer
15 years 10 months ago
Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming
This paper studies inductive definitions involving binders, in which aliasing between free and bound names is permitted. Such aliasing occurs in informal specifications of operatio...
Matthew R. Lakin, Andrew M. Pitts
CIKM
2008
Springer
15 years 8 months ago
Aggregate queries over ontologies
Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for ag...
Diego Calvanese, Evgeny Kharlamov, Werner Nutt, Ca...
ASIAN
2009
Springer
308views Algorithms» more  ASIAN 2009»
15 years 7 months ago
Automated Security Proof for Symmetric Encryption Modes
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
Martin Gagné, Pascal Lafourcade, Yassine La...