Specification Languages: SystemC

2021 ◽  
pp. 85-117
Author(s):  
KCS Murti
Keyword(s):  
Specification Languages

Evaluation Criteria for Real-Time Specification Languages

1992 ◽  
Author(s):  
Paul C. Clements ◽  
Carolyn E. Gasarch ◽  
Ralph D. Jeffords
Keyword(s):  
Real Time ◽  
Evaluation Criteria ◽  
Specification Languages

Specifying with Interface and Trait Abstractions in Abstract State Machines: A Controlled Experiment

2021 ◽  
Vol 30 (4) ◽  
pp. 1-29
Author(s):  
Philipp Paulweber ◽  
Georg Simhandl ◽  
Uwe Zdun
Keyword(s):  
Formal Methods ◽  
Formal Method ◽  
Object Oriented ◽  
Controlled Experiment ◽  
Specification Languages ◽  
Randomized Design ◽  
Textual Description ◽  
Efficiency And Effectiveness ◽  
Completely Randomized Design ◽  
Experimental Group

Abstract State Machine (ASM) theory is a well-known state-based formal method. As in other state-based formal methods, the proposed specification languages for ASMs still lack easy-to-comprehend abstractions to express structural and behavioral aspects of specifications. Our goal is to investigate object-oriented abstractions such as interfaces and traits for ASM-based specification languages. We report on a controlled experiment with 98 participants to study the specification efficiency and effectiveness in which participants needed to comprehend an informal specification as problem (stimulus) in form of a textual description and express a corresponding solution in form of a textual ASM specification using either interface or trait syntax extensions. The study was carried out with a completely randomized design and one alternative (interface or trait) per experimental group. The results indicate that specification effectiveness of the traits experiment group shows a better performance compared to the interfaces experiment group, but specification efficiency shows no statistically significant differences. To the best of our knowledge, this is the first empirical study studying the specification effectiveness and efficiency of object-oriented abstractions in the context of formal methods.

scholarly journals From parametric trace slicing to rule systems

2021 ◽  
Author(s):  
Giles Reger ◽  
David Rydeheard
Keyword(s):  
Runtime Verification ◽  
Specification Languages ◽  
Execution Traces ◽  
Running System ◽  
Proof Of Correctness ◽  
Rule Systems ◽  
The Relationship ◽  
Specification Techniques ◽  
Previous Conference

AbstractParametric runtime verification is the process of verifying properties of execution traces of (data carrying) events produced by a running system. This paper continues our work exploring the relationship between specification techniques for parametric runtime verification. Here we consider the correspondence between trace-slicing automata-based approaches and rule systems. The main contribution is a translation from quantified automata to rule systems, which has been implemented in Scala. This then allows us to highlight the key differences in how the two formalisms handle data, an important step in our wider effort to understand the correspondence between different specification languages for parametric runtime verification. This paper extends a previous conference version of this paper with further examples, a proof of correctness, and an optimisation based on a notion of redundancy observed during the development of the translation.

Semantics of templates in a compositional framework for building logics

2015 ◽  
Vol 15 (4-5) ◽  
pp. 681-695 ◽  
Author(s):  
INGMAR DASSEVILLE ◽  
MATTHIAS VAN DER HALLEN ◽  
GERDA JANSSENS ◽  
MARC DENECKER
Keyword(s):  
Second Order ◽  
Alternative View ◽  
Specification Languages ◽  
Descriptive Complexity ◽  
Base Logic

AbstractThere is a growing need for abstractions in logic specification languages such as FO(·) and ASP. One technique to achieve these abstractions are templates (sometimes called macros). While the semantics of templates are virtually always described through a syntactical rewriting scheme, we present an alternative view on templates as second order definitions. To extend the existing definition construct of FO(·) to second order, we introduce a powerful compositional framework for defining logics by modular integration of logic constructs specified as pairs of one syntactical and one semantical inductive rule. We use the framework to build a logic of nested second order definitions suitable to express templates. We show that under suitable restrictions, the view of templates as macros is semantically correct and that adding them does not extend the descriptive complexity of the base logic, which is in line with results of existing approaches.

Categorical concepts for parameterized partial specifications

1995 ◽  
Vol 5 (2) ◽  
pp. 153-188 ◽  
Author(s):  
Ingo Claßen ◽  
Martin GroßE-Rhode ◽  
Uwe Wolter
Keyword(s):  
Structural Theory ◽  
Specification Languages ◽  
Alternative Definition ◽  
Categorical Approach ◽  
Categorical Constructions ◽  
Definition Of ◽  
Act One

Categorical constructions inherent to a theory of algebras with strict partial operations are presented and exploited to provide a categorical deduction calculus for conditional existence equations and an alternative definition of such algebras based on the notion of syntactic categories. A compact presentation of the structural theory of parameterized (partial) specifications is given using the categorical approach. This theory is shown to be suitable for providing initial semantics as well as the compositionality results necessary for the definition of specification languages like ACT ONE and ACT TWO

scholarly journals Constraint Problem Specification as Compression

10.29007/7ths ◽  
2018 ◽  
Author(s):  
Steve Prestwich ◽  
S. Armagan Tarim ◽  
Roberto Rossi
Keyword(s):  
Logic Programming ◽  
Data Compression ◽  
Constraint Programming ◽  
Auxiliary Problem ◽  
Combinatorial Problems ◽  
Specification Languages ◽  
Constraint Problem ◽  
High Level ◽  
Natural Way ◽  
Comparable Size

Constraint Programming is a powerful and expressive framework for modelling and solving combinatorial problems. It is nevertheless not always easy to use, which has led to the development of high-level specification languages. We show that Constraint Logic Programming can be used as a meta-language to describe itself more compactly at a higher level of abstraction. This can produce problem descriptions of comparable size to those in existing specification languages, via techniques similar to those used in data compression. An advantage over existing specification languages is that, for a problem whose specification requires the solution of an auxiliary problem, a single specification can unify the two problems. Moreover, using a symbolic representation of domain values leads to a natural way of modelling channelling constraints.

Sign in / Sign up

Export Citation Format

Share Document