Jan Friso Groote
Jan Friso Groote

homepage
J.F.Grooteattue.nl

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article9.84
Citation Count895
Publication count91
Publication years1989-2017
Available for download6
Average downloads per article282.50
Downloads (cumulative)1,695
Downloads (12 Months)127
Downloads (6 Weeks)20
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


92 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 92
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
June 2017 ACM Transactions on Computational Logic (TOCL): Volume 18 Issue 2, June 2017
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 6,   Downloads (12 Months): 48,   Downloads (Overall): 95

Full text available: PDFPDF
We provide a new algorithm to determine stuttering equivalence with time complexity O ( m log n ), where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimulation in O ( m ...
Keywords: algorithm, Branching bisimulation

2
October 2016 Science of Computer Programming: Volume 128 Issue C, October 2016
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

Numerous properties of random graphs are highly predictable. Even by exploring a small part reliable observations are possible regarding their structure and size. An unfortunate observation is that standard models for random graphs, such as the Erdös-Rényi model, do not reflect the structure of the graphs that describe distributed systems ...
Keywords: P-parallel random transition system, Random graph, State space size

3
April 2016 Proceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9636
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We provide a new algorithm to determine stuttering equivalence with time complexity $$Om \log n$$, where n is the number of states and m is the number of transitions of a Kripke structure. This algorithm can also be used to determine branching bisimulation in $$Om\log | Act |+\log n$$ time. ...

4
February 2016 International Journal on Software Tools for Technology Transfer (STTT): Volume 18 Issue 1, February 2016
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We evaluate the effect of applying the commercial formal technique Analytical Software Design (ASD) to an industrial project. In ASD, interfaces and software designs are modelled using a formal tabular notation. The ASD tool set supports formal checks of these models, such as deadlock freedom and interface compliance. In addition, ...
Keywords: Code generation, Component-based design, Formal methods, Industrial application, Compositional verification

5
January 2015 Science of Computer Programming: Volume 97 Issue P1, January 2015
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

Software engineers are humans and so they make lots of mistakes. Typically 1 out of 10 to 100 tasks go wrong. The only way to avoid these mistakes is to introduce redundancy in the software engineering process. This article is a plea to consciously introduce several levels of redundancy for ...
Keywords: Redundancy, Software quality, Software engineering

6
January 2015 Software Testing, Verification & Reliability: Volume 25 Issue 1, January 2015
Publisher: John Wiley and Sons Ltd.
Bibliometrics:
Citation Count: 3

During the last two decades, we modelled the behaviour of a large number of systems. We noted that different styles of modelling had quite an effect on the size of the state spaces of the modelled systems. The differences were so substantial that some specification styles led to far too ...
Keywords: design for verifications, specification guidelines, model checking, state space explosion

7
November 2009 FMCO'09: Proceedings of the 8th international conference on Formal methods for components and objects
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Specifying concurrent systems can be done using a variety of languages. These languages have different features and therefore are not necessarily equally suitable for capturing concepts from reality with respect to both expressivity and ease-of-use. This paper addresses these aspects for the specification language mCRL2 by considering the 2 × ...

8 published by ACM
October 2009 WESE '09: Proceedings of the 2009 Workshop on Embedded Systems Education
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1,   Downloads (12 Months): 2,   Downloads (Overall): 111

Full text available: PDFPDF
The three technical universities in the Netherlands (Eindhoven University of Technology, Delft University of Technology and University of Twente), abbreviated as 3TU, started a joint master on Embedded Systems in 2006. Embedded Systems is an interdisciplinary area of Electrical Engineering, Computer Science, Mechanical Engineering and Applied Mathematics. This paper discusses ...
Keywords: multi-core SoC design, system design, embedded systems education

9
April 2009 Formal Aspects in Security and Trust: 5th International Workshop, FAST 2008 Malaga, Spain, October 9-10, 2008 Revised Selected Papers
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 1

We introduce the notion of parameterised anonymity, to formalize the anonymity property of protocols with an arbitrary number of participants. This definition is an extension of the well known CSP anonymity formalization of Schneider and Sidiropoulos [18]. Using recently developed invariant techniques for solving parameterised boolean equation systems, we then ...

10
December 2008 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 223, December, 2008
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 0

Switching graphs are graphs containing switches. By using boolean functions called switch settings, these switches can be put in a fixed direction to obtain an ordinary graph. For many problems, switching graphs are a remarkable straightforward and natural model, but they have hardly been studied. We study the complexity of ...
Keywords: model checking, Boolean equation systems, parity games, μ-calculus, Switching graphs

11
July 2007 ACSD '07: Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 4

We describe a translation from Rebeca, an actor-based language, to mCRL2, a process algebra enhanced with data types. The main motivation is to exploit the verification tools and theories developed for mCRL2 in Rebeca. The mapping is applied to several case-studies including the tree identify phase of the IEEE 1394 ...

12
July 2007 Theoretical Computer Science: Volume 379 Issue 1-2, July 2007
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 4

We propose a calculus for marked labelled nets (components), with places and transitions as atoms and merge, addition, fusion and relabelling as operators. The operators are defined using graph-based transformations; each net can be represented by a term. Next, we define both a step semantics for nets and a Plotkin-style ...
Keywords: Bisimulation, Process algebra, Semantics, Modelling, Verification, Petri nets

13
March 2007 Theoretical Computer Science: Volume 373 Issue 3, March 2007
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 24

In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981]. Subsequently, ...
Keywords: Formal semantics, Framework, Structural operational semantics, Rule formats

14
February 2007 Science of Computer Programming: Volume 64 Issue 3, February, 2007
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 6

This paper presents a lock-free algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked/store-conditional (LL/SC) or compare-and-swap (CAS) offered by machine architectures. The algorithm is concurrent in the sense that garbage collection can run concurrently with the application (the mutator threads). It is parallel in ...
Keywords: Correctness, Garbage collection, Lock-free, Shared-memory, Theorem proving

15
May 2006 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 156 Issue 1, May, 2006
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 3

In 1981 Structural Operational Semantics (SOS) was introduced as a systematic way to define operational semantics of programming languages by a set of rules of a certain shape [G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, September 1981. Also ...
Keywords: Framework, Structural Operational Semantics, Rule Formats, Formal Semantics

16
April 2006 IPDPS'06: Proceedings of the 20th international conference on Parallel and distributed processing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1


17
February 2006 International Journal on Software Tools for Technology Transfer (STTT): Volume 8 Issue 1, February 2006
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Insight into the global structure of a state space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a method to visualize the structure of very large state spaces with millions of nodes. The method uses a ...
Keywords: Transition systems, State transition graphs, Graph drawing, State space, Visualization

18
February 2006 International Journal on Software Tools for Technology Transfer (STTT) - Special section on Tools and Algorithms for the Construction and Analysis of Systems: Volume 8 Issue 1, February 2006
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 5

Insight into the global structure of a state space is of great help in the analysis of the underlying process. We advocate the use of visualization for this purpose and present a method to visualize the structure of very large state spaces with millions of nodes. The method uses a ...
Keywords: State transition graphs, Graph drawing, State space, Visualization, Transition systems

19
November 2005 Electronic Notes in Theoretical Computer Science (ENTCS): Volume 139 Issue 1, November, 2005
Publisher: Elsevier Science Publishers B. V.
Bibliometrics:
Citation Count: 2

The @mCRL language and its corresponding tool set form a powerful methodology for the verification of distributed systems. We demonstrate its use by applying it to the well-known Bilateral Key Exchange security protocol.
Keywords: Security protocol verification, model checking, μCRL

20
October 2005 Theoretical Computer Science - Formal methods for components and objects: Volume 343 Issue 3, 17 October 2005
Publisher: Elsevier Science Publishers Ltd.
Bibliometrics:
Citation Count: 15

Boolean equation system are a useful tool for verifying formulas from modal µ-calculus on transition systems (see [Mader, Lecture Notes in Computer Science, Vol. 1019, 1995, pp. 72-88] for an excellent treatment). We are interested in an extension of boolean equation systems with data. This allows to formulate and prove ...
Keywords: parameterised boolean equation systems, infinite state systems, first order modal µ-calculus, model checking



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us