Sciweavers

122 search results - page 11 / 25
» Computing Properties of Numerical Imperative Programs by Sym...
Sort
View
ENTCS
2002
144views more  ENTCS 2002»
14 years 11 months ago
Logics and Multi-agents: towards a new symbolic model of cognition
Abstract The last edition of CLIMA, held in 2001 in Paphos (Cyprus) ended with a panel session on the role of Computational Logic (CL) in Multi-Agent Systems (MAS). Two dimensions ...
Paolo Torroni
89
Voted
CCS
2009
ACM
15 years 6 months ago
A security-preserving compiler for distributed programs: from information-flow policies to cryptographic mechanisms
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
Cédric Fournet, Gurvan Le Guernic, Tamara R...
SAC
2010
ACM
15 years 6 months ago
Polytope-based computation of polynomial ranges
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
Christoph Fünfzig, Dominique Michelucci, Sebt...
NJC
2006
86views more  NJC 2006»
14 years 11 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
BIRTHDAY
2004
Springer
15 years 5 months ago
Retracing the Semantics of CSP
CSP was originally introduced as a parallel programming language in which sequential imperative processes execute concurrently and communicate by synchronized input and output. The...
Stephen D. Brookes