Sciweavers

255 search results - page 17 / 51
» Proving BDI Properties of Agent-Oriented Programming Languag...
Sort
View
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
15 years 26 days ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani
ECOOP
2006
Springer
15 years 3 months ago
Session Types for Object-Oriented Languages
A session takes place between two parties; after establishing a connection, each party interleaves local computations and communications (sending or receiving) with the other. Ses...
Mariangiola Dezani-Ciancaglini, Dimitris Mostrous,...
FSTTCS
2006
Springer
15 years 3 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
ESOP
2012
Springer
13 years 7 months ago
Concurrent Library Correctness on the TSO Memory Model
Abstract. Linearizability is a commonly accepted notion of correctness for libraries of concurrent algorithms. Unfortunately, it is only appropriate for sequentially consistent mem...
Sebastian Burckhardt, Alexey Gotsman, Madanlal Mus...
TON
2012
13 years 2 months ago
On New Approaches of Assessing Network Vulnerability: Hardness and Approximation
—Society relies heavily on its networked physical infrastructure and information systems. Accurately assessing the vulnerability of these systems against disruptive events is vit...
Thang N. Dinh, Ying Xuan, My T. Thai, Panos M. Par...