Sciweavers

1671 search results - page 148 / 335
» Language Constructs for Multi-agent Programming
Sort
View
ICFEM
2004
Springer
15 years 11 months ago
From Circus to JCSP
Circus is a combination of Z, CSP, and Morgan’s refinement calculus; it has an associated refinement strategy that supports the development of reactive programs. In this work, ...
Marcel Oliveira, Ana Cavalcanti
TACAS
1997
Springer
72views Algorithms» more  TACAS 1997»
15 years 10 months ago
The Term Processor Generator Kimwitu
The Kimwitu system is a meta-tool that supports the construction of programs (tools) that operate on trees or terms. The system supports open multi-paradigm programming, in that i...
Peter van Eijk, Axel Belinfante, Henk Eertink, Hen...
PLDI
2006
ACM
16 years 10 days ago
Refactoring programs to secure information flows
Adding a sound information flow security policy to an existing program is a difficult task that requires major analysis of and changes to the program. In this paper we show how ...
Scott F. Smith, Mark Thober
TLDI
2010
ACM
247views Formal Methods» more  TLDI 2010»
16 years 3 months ago
F-ing modules
ML modules are a powerful language mechanism for decomposing programs into reusable components. Unfortunately, they also have a reputation for being “complex” and requiring fa...
Andreas Rossberg, Claudio V. Russo, Derek Dreyer
POPL
2006
ACM
16 years 6 months ago
A fixpoint calculus for local and global program flows
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan