Sciweavers

TSE
2011
107views more  TSE 2011»
13 years 1 months ago
Deriving a Slicing Algorithm via FermaT Transformations
In this paper we present a case study in deriving an algorithm from a formal specification via FermaT transformations. The general method (which is presented in a separate paper)...
Martin P. Ward, Hussein Zedan
PR
2007
111views more  PR 2007»
13 years 5 months ago
Design and formal proof of a new optimal image segmentation program with hypermaps
This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an opt...
Jean-François Dufourd
JLP
2007
95views more  JLP 2007»
13 years 6 months ago
Model checking a cache coherence protocol of a Java DSM implementation
Jackal is a fine-grained distributed shared memory implementation of the Java programming language. It aims to implement Java’s memory model and allows multithreaded Java progr...
Jun Pang, Wan Fokkink, Rutger F. H. Hofman, Ronald...
FMOODS
2007
13 years 7 months ago
Formal Modeling and Analysis of the OGDC Wireless Sensor Network Algorithm in Real-Time Maude
This paper describes the application of Real-Time Maude to the formal specification, simulation, and further formal analysis of the sophisticated state-of-the-art OGDC wireless se...
Peter Csaba Ölveczky, Stian Thorvaldsen
FMOODS
2007
13 years 7 months ago
A Probabilistic Formal Analysis Approach to Cross Layer Optimization in Distributed Embedded Systems
We present a novel approach, based on probabilistic formal methods, to developing cross-layer resource optimization policies for resource limited distributed systems. One objective...
Minyoung Kim, Mark-Oliver Stehr, Carolyn L. Talcot...
ICSE
1997
IEEE-ACM
13 years 10 months ago
A Theory of Probabilistic Functional Testing
We propose a framework for “probabilistic functional testing.” The success of a test data set generated according to our method guarantees a certain level of confidence into ...
Gilles Bernot, Laurent Bouaziz, Pascale Le Gall
CCS
2004
ACM
13 years 11 months ago
Lessons learned using alloy to formally specify MLS-PCA trusted security architecture
In order to solve future Multi Level Security (MLS) problems, we have developed a solution based on the DARPA Polymorphous Computing Architecture (PCA). MLS-PCA uses a novel distr...
Brant Hashii
DEXA
2005
Springer
109views Database» more  DEXA 2005»
13 years 12 months ago
Formalizing the XML Schema Matching Problem as a Constraint Optimization Problem
The first step in finding an efficient way to solve any difficult problem is making a complete, possibly formal, problem specification. This paper introduces a formal specifica...
Marko Smiljanic, Maurice van Keulen, Willem Jonker
CCS
2005
ACM
13 years 12 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
AGTIVE
2007
Springer
14 years 17 days ago
Communities of Autonomous Units for Pickup and Delivery Vehicle Routing
Communities of autonomous units are being developed for formal specification and semantic analysis of systems of interacting and mobile components. The autonomous units of a commu...
Hans-Jörg Kreowski, Sabine Kuske