Sciweavers

2687 search results - page 292 / 538
» Formal Analysis of PKCS
Sort
View
PPOPP
2010
ACM
16 years 3 months ago
Featherweight X10: a core calculus for async-finish parallelism
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...
Jonathan K. Lee, Jens Palsberg
ISPW
2005
IEEE
16 years 7 days ago
Automatically Analyzing Software Processes: Experience Report
Sound methods of analysis and comparison of software processes are crucial for such tasks as process understanding, process correctness verification, evolution management, proces...
Rodion M. Podorozhny, Dewayne E. Perry, Leon J. Os...
MODELS
2009
Springer
15 years 11 months ago
From UML to Alloy and Back Again
Abstract. Model Transformations can be used to bridge the gap between design and analysis technical spaces by creating tools that allow a model produced by a designer to be transfo...
Seyyed M. A. Shah, Kyriakos Anastasakis, Behzad Bo...
FSTTCS
2006
Springer
15 years 10 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
MSWIM
2006
ACM
16 years 18 days ago
Testing methodology for an ad hoc routing protocol
In this paper, we define a model of an ad hoc routing protocol, i.e. the OLSR (Optimized Link-State Routing) protocol. This model handles novel constraints related to such networ...
Stéphane Maag, Fatiha Zaïdi