The derivation of the Feynman rules for lattice perturbation theory from actions and operators is complicated, especially for highly improved actions such as HISQ. This task is, however, both important and particularly suitable for automation. We describe a suite of software to generate and evaluate Feyn-man rules for a wide range of lattice field theories with gluons and (relativistic and/or h...

ion in Probabilistic Process Algebra Suzana Andova Eindhoven University of Technology In this work we treat the problem of abstraction in fully probabilistic process algebra and its semantics based on branching bisimulation. Since the idea of fairness rules together with abstraction (introduced by the abstraction operator tauI and constant tau meaning an internal action) is central to the verif...

Verification of IEC61131-3 based safety applications is a challenge in the development process of industrial systems. In this paper, we formally describe the set of transformation rules we have defined for the automatic transformation of IEC61131-3 function block based safety applications to UPPAAL timed automata models. These models are used for the verification of the safety application. Both...

For the development of practical semantic applications, ontologies are commonly used with rule extensions. Prominent examples of semantic applications are Semantic Wikis, Semantic Desktops, but also advanced Web Services and agents. The application of rules increases the expressiveness of the underlying knowledge in many ways. Likewise, the integration creates new challenges for the design proc...

While temporal verification of programs is a topic with a long history, its traditional basis—semantics based on word languages—is ill-suited for modular reasoning about procedural programs. We address this issue by defining the semantics of procedural (potentially recursive) programs using languages of nested words and developing a framework for temporal reasoning around it. This generalizatio...

Alloy is a relational specification language with a built-in transitive closure operator which makes it particularly suitable for writing concise specifications of linked data structures. Several tools support Alloy specifications for Java programs. However, they can only check the validity of those specifications with respect to a bounded domain, and thus, in general, cannot provide correctnes...

The automation of verification techniques based on firstorder logic specifications has benefited greatly from verification infrastructures such as Boogie and Why. These offer an intermediate language that can express diverse language features and verification techniques, as well as back-end tools such as verification condition generators. However, these infrastructures are not well suited for v...

This paper focuses on how multiparadigm – namely, constraint, object-oriented and higher-order – programming can be drawn upon not only to specify multiparameterized linguistic realization engines but also and above all to rationalize their configuration into full-fledged generation modules for specific language-application pairs. We describe Manati, one such engine whose instantiations render ...

Embedded cores are being increasingly used in the design of large system-on-a-chip (SoC). Because of the high complexity of SoC, the design verification is a challenge for system integrators. To reduce the verification complexity, the port-order fault (POF) model was proposed. It has been used for verifying core-based designs and the corresponding verification pattern generation has been develo...

We present an OCL framework and tool for the description and verification of consistency rules of extra-functional properties (EFPs) in component and connector (C&C) models. The framework is based on our previously defined structure of EFP consistency rules using selection, aggregation, and comparison operators, and provides C&C specific OCL functions and configurations that allow engineers to ...