Search Results - "Igor Walukiewicz"

Typing weak MSOL properties by Sylvain Salvati, Igor Walukiewicz

“…We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be…”
Get full text

Soundness in negotiations by Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz

“…Negotiations are a formalism for describing multiparty distributed cooperation. Alternatively, they can be seen as a model of concurrency with synchronized…”
Get full text

Using models to model-check recursive schemes by Salvati, Sylvain, Walukiewicz, Igor

“…We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator,…”
Get full text

Wreath Products of Forest Algebras, with Applications to Tree Logics by Bojanczyk, Mikolaj, Walukiewicz, Igor, Straubing, Howard

“…We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various…”
Get full text

Choice functions and well-orderings over the infinite binary tree by Carayol Arnaud, Löding Christof, Niwinski Damian, Walukiewicz Igor

Get full text

A lower bound on web services composition by Muscholl, Anca, Walukiewicz, Igor

“…A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a…”
Get full text

Weak Alternating Timed Automata by Parys, Pawel, Walukiewicz, Igor

“…Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for…”
Get full text

Positional Determinacy of Games with Infinitely Many Priorities by Graedel, Erich, Walukiewicz, Igor

“…We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only…”
Get full text

Lambda Y-Calculus With Priorities by Walukiewicz, Igor

“…The lambda Y-calculus with priorities is a variant of the simply-typed lambda calculus designed for higher-order model-checking. The higher-order…”
Get full text

Krivine machines and higher-order schemes by Salvati, Sylvain, Walukiewicz, Igor

“…We propose a new approach to analyzing higher-order recursive schemes. Many results in the literature use automata models generalizing pushdown automata, most…”
Get full text

Better abstractions for timed automata by Herbreteau, Frédéric, Srivathsan, B., Walukiewicz, Igor

“…We study the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of…”
Get full text

Model Based Approach to Verification of Higher-Order Programs: Invited Talk at the Fourth International Workshop on Verification and Program Transformation by Walukiewicz, Igor

Get full text

Pushdown Processes: Games and Model-Checking by Walukiewicz, Igor

“…A pushdown game is a two player perfect information infinite game on a transition graph of a pushdown automaton. A winning condition in such a game is defined…”
Get full text

Monadic second-order logic on tree-like structures by Walukiewicz, Igor

“…An operation M ∗ which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered…”
Get full text

An alternate proof of StatmanE14s finite completeness theorem by Srivathsan, B, Walukiewicz, Igor

“…StatmanE14s finite completeness theorem says that for every pair of non-equivalent terms of simply-typed lambda-calculus there is a model that separates them…”
Get full text

Static analysis of deterministic negotiations by Esparza, Javier, Muscholl, Anca, Walukiewicz, Igor

“…Negotiation diagrams are a model of concurrent computation akin to workflow Petri nets. Deterministic negotiation diagrams, equivalent to the much studied and…”
Get full text

Using Models to Model-check Recursive Schemes by Salvati, Sylvain, Walukiewicz, Igor

“…We propose a model-based approach to the model checking problem for recur-sive schemes. Since simply typed lambda calculus with the fixpoint operator,…”
Get full text

The Diagonal Problem for Higher-Order Recursion Schemes is Decidable by Clemente, Lorenzo, Parys, Paweł, Salvati, Sylvain, Walukiewicz, Igor

“…A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown…”
Get full text

Describing properties of concurrent systems (Logic for Traces): (invited talk) by Igor, Walukiewicz

“…Mazurkiewicz traces are one of the simplest non-interleaving model of executions. For some systems the trace model may be exponentially smaller than the…”
Get full text

Verifying higher-order concurrency with data automata by Dixon, Alex, Lazic, Ranko, Murawski, Andrzej S., Walukiewicz, Igor

“…Using a combination of automata-theoretic and game-semantic techniques, we propose a method for analysing higher-order concurrent programs. Our language of…”
Get full text