Results 1  10
of
120,695
Sorted Psicalculi with Generalised Pattern Matching
"... Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we extend the applicability of psicalculi in three ways. Firstly, we introduce patterns and pattern matching, in order to allow modellin ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Psicalculi is a parametric framework for extensions of the picalculus, with arbitrary data structures and logical assertions for facts about data. In this paper we extend the applicability of psicalculi in three ways. Firstly, we introduce patterns and pattern matching, in order to allow
Bells and Whistles: Advanced Language Features in PsiCalculi
, 2013
"... Psicalculi is a parametric framework for process calculi similar to popular picalculus extensions such as the explicit fusion calculus, the applied picalculus and the spi calculus. Remarkably, machinechecked proofs of standard algebraic and congruence properties of bisimilarity apply to every i ..."
Abstract
 Add to MetaCart
Psicalculi is a parametric framework for process calculi similar to popular picalculus extensions such as the explicit fusion calculus, the applied picalculus and the spi calculus. Remarkably, machinechecked proofs of standard algebraic and congruence properties of bisimilarity apply to every
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing
The 4+1 view model of architecture
 IEEE SOFTWARE
, 1995
"... The 4+1 View Model organizes a description of a software architecture using five concurrent views, each of which
addresses a specific set of concerns. Architects capture their design decisions in four views and use the fifth view to illustrate and validate them. ..."
Abstract

Cited by 553 (4 self)
 Add to MetaCart
The 4+1 View Model organizes a description of a software architecture using five concurrent views, each of which
addresses a specific set of concerns. Architects capture their design decisions in four views and use the fifth view to illustrate and validate them.
A Compositional Approach to Performance Modelling
, 1996
"... Performance modelling is concerned with the capture and analysis of the dynamic behaviour of computer and communication systems. The size and complexity of many modern systems result in large, complex models. A compositional approach decomposes the system into subsystems that are smaller and more ea ..."
Abstract

Cited by 746 (102 self)
 Add to MetaCart
easily modelled. In this thesis a novel compositional approach to performance modelling is presented. This approach is based on a suitably enhanced process algebra, PEPA (Performance Evaluation Process Algebra). The compositional nature of the language provides benefits for model solution as well
LanguageBased InformationFlow Security
 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
, 2003
"... Current standard security practices do not provide substantial assurance that the endtoend behavior of a computing system satisfies important security policies such as confidentiality. An endtoend confidentiality policy might assert that secret input data cannot be inferred by an attacker throug ..."
Abstract

Cited by 821 (57 self)
 Add to MetaCart
Current standard security practices do not provide substantial assurance that the endtoend behavior of a computing system satisfies important security policies such as confidentiality. An endtoend confidentiality policy might assert that secret input data cannot be inferred by an attacker through the attacker's observations of system output; this policy regulates information flow.
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 653 (35 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
This work is licensed under the Creative Commons Attribution License. Concurrency Models with Causality and Events as Psicalculi
"... Psicalculi are a parametric framework for nominal calculi, where standard calculi are found as instances, like the picalculus, or the cryptographic spicalculus and appliedpi. Psicalculi have an interleaving operational semantics, with a strong foundation on the theory of nominal sets and proc ..."
Abstract
 Add to MetaCart
and process algebras. Much of the expressive power of psicalculi comes from their logical part, i.e., assertions, conditions, and entailment, which are left quite open thus accommodating a wide range of logics. We are interested in how this expressiveness can deal with eventbased models of concurrency. We
LogP: Towards a Realistic Model of Parallel Computation
, 1993
"... A vast body of theoretical research has focused either on overly simplistic models of parallel computation, notably the PRAM, or overly specific models that have few representatives in the real world. Both kinds of models encourage exploitation of formal loopholes, rather than rewarding developme ..."
Abstract

Cited by 562 (15 self)
 Add to MetaCart
parallel algorithms and to offer guidelines to machine designers. Such a model must strike a balance between detail and simplicity in order to reveal important bottlenecks without making analysis of interesting problems intractable. The model is based on four parameters that specify abstractly
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Results 1  10
of
120,695