Search Results - "Şerbănuţă, Traian Florin"

All-Path Reachability Logic by Andrei Stefanescu, Stefan Ciobaca, Radu Mereuta, Brandon Moore, Traian Florin Serbanuta, Grigore Rosu

“…This paper presents a language-independent proof system for reachability properties of programs written in non-deterministic (e.g., concurrent) languages,…”
Get full text

From Hybrid Modal Logic to Matching Logic and Back by Leuştean, Ioana, Moangă, Natalia, Şerbănuţă, Traian Florin

“…Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and…”
Get full text

An overview of the K semantic framework by Roșu, Grigore, Șerbănută, Traian Florin

Get full text

Language definitions as rewrite theories by Rusu, Vlad, Lucanu, Dorel, Şerbănuţă, Traian-Florin, Arusoaie, Andrei, Ştefănescu, Andrei, Roşu, Grigore

“…K is a formal framework for defining operational semantics of programming languages. The K-Maude compiler translates K language definitions to Maude rewrite…”
Get full text

A semantic approach to interpolation by Popescu, Andrei, Şerbănuţă, Traian Florin, Roşu, Grigore

“…Craig interpolation is investigated for various types of formulae. By shifting the focus from syntactic to semantic interpolation, we generate, prove and…”
Get full text

Extending Parikh matrices by SERBANUTA, Traian-Florin

“…We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of…”
Get full text

jPredictor: a predictive runtime analysis tool for java by Chen, Feng, Serbanuta, Traian Florin, Rosu, Grigore

“…jPredictor is a tool for detecting concurrency errors in Java programs. The Java program is instrumented to emit property-relevant events at runtime and then…”
Get full text

Many-sorted hybrid modal languages by Leuştean, Ioana, Moangă, Natalia, Şerbănuţă, Traian Florin

“…We continue our investigation into using the hybridization technique on top of the many-sorted polyadic modal logic we have previously defined. By adding…”
Get full text

K Overview and SIMPLE Case Study by Roşu, Grigore, Şerbănuţă, Traian Florin

“…This paper gives an overview of the tool-supported K framework for semantics-based programming language design and formal analysis. K provides a convenient…”
Get full text

A rewriting logic approach to operational semantics by Şerbănuţă, Traian Florin, Roşu, Grigore, Meseguer, José

“…This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming…”
Get full text

The K Primer (version 3.3) by Şerbănuţă, Traian Florin, Arusoaie, Andrei, Lazar, David, Ellison, Chucky, Lucanu, Dorel, Roşu, Grigore

“…This paper serves as a brief introduction to the K tool, a system for formally defining programming languages. It is shown how sequential or concurrent…”
Get full text

Self-organising assembly systems formally specified in Maude by Frei, Regina, Şerbănuţă, Traian Florin, Marzo Serugendo, Giovanna Di

“…This article recapitulates on the research done in self-organising assembly systems (SOAS) and presents the completed formal specifications and their…”
Get full text

Ambient intelligence in self-organising assembly systems using the chemical reaction model by Frei, Regina, Di Marzo Serugendo, Giovanna, Șerbănuță, Traian Florin

“…This article discusses self-organising assembly systems (SOAS), a type of assembly systems that (1) participate in their own design by spontaneously organising…”
Get full text

P systems with control nuclei: The concept by Chira, Camelia, Şerbănuţă, Traian Florin, Ştefănescu, Gheorghe

Get full text

A Rewriting Logic Approach to Operational Semantics (Extended Abstract) by Şerbănuţă, Traian Florin, Roşu, Grigore, Meseguer, José

“…This paper shows how rewriting logic semantics (RLS) can be used as a computational logic framework for operational semantic definitions of programming…”
Get full text

Rewriting Logic Systems by Denker, Grit, Talcott, Carolyn, Rosu, Grigore, van den Brand, Mark, Eker, Steven, Şerbănuţă, Traian Florin

“…We present an overview of rewriting-based systems that were presented at the workshop…”
Get full text

All-Path Reachability Logic by Stefanescu, Andrei, Ciobaca, Stefan, Mereuta, Radu, Moore, Brandon, Serbanuta, Traian Florin, Rosu, Grigore

“…Logical Methods in Computer Science, Volume 15, Issue 2 (April 30, 2019) lmcs:4939 This paper presents a language-independent proof system for reachability…”
Get full text

Rewriting Semantics and Analysis of Concurrency Features for a C-like Language by Şerbănuţă, Traian Florin

“…This paper shows how one can easily transform K definitions of programming languages into runtime verification tools. To increase the confidence that these…”
Get full text

Many-Sorted Hybrid Modal Languages by Leuştean, Ioana, Moangă, Natalia, Şerbănuţă, Traian Florin

“…We continue our investigation into hybrid polyadic multi-sorted logic with a focus on expresivity related to the operational and axiomatic semantics of…”
Get full text

Validating Labelled State Transition and Message Production Systems: A Theory for Modelling Faulty Distributed Systems by Zamfir, Vlad, Calancea, Mihai, Diaconescu, Denisa, Kołowski, Wojciech, Moore, Brandon, Palmskog, Karl, Şerbănuţă, Traian Florin, Stay, Michael, Trufaş, Dafina, Tušil, Jan

“…Modeling and formally reasoning about distributed systems with faults is a challenging task. To address this problem, we propose the theory of Validating…”
Get full text