Filters








50,226 Hits in 5.8 sec

The IRIS Network of Excellence: Future Directions in Interactive Storytelling [chapter]

Marc Cavazza, Ronan Champagnat, Riccardo Leonardi
2009 Lecture Notes in Computer Science  
In this paper we highlight some new research directions developing within the network: one is revisiting narrative formalisation through the use of Linear Logic and the other is challenging the conventional  ...  framework of basing Interactive Storytelling on computer graphics to explore the content-based recombination of video sequences.  ...  The IRIS Network of Excellence is funded by the European  ... 
doi:10.1007/978-3-642-10643-9_4 fatcat:wl3a24cv7zhcvb6emgw5vypsyq

Syntactic control of interference revisited

1995 Theoretical Computer Science  
We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings.  ...  of these models.  ...  Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional  ... 
doi:10.1016/0304-3975(96)80138-1 fatcat:k3rggrbb5zfflbka3rpi243s3a

Book announcements

1993 Discrete Applied Mathematics  
The logic of plausibility states. The struc- ture of plausibility-driven design. Justification constraints. Exercises in plausibility-driven design. Discussion, contrasts and comparisons.  ...  The use of conceptual models. Chapter 8: Hoare logic. The formal development of programs. The FD paradigm in computer architecture. The formal design of microprograms.  ... 
doi:10.1016/0166-218x(93)90173-l fatcat:l4psazjvkjcm5ksswvubyespla

Saving space by fully exploiting invisible transitions [chapter]

Hillel Miller, Shmuel Katz
1996 Lecture Notes in Computer Science  
Checking that a given finite state program satisfies a linear temporal logic property suffers from a severe space and time explosion.  ...  One way to cope with this is to reduce the state graph used for model checking. We present an algorithm for constructing a state graph that is a projection of the program's state graph.  ...  Introduction In order to reduce the space needed for model checking of linear temporal logic properties, several pre-processing techniques have been suggested to construct smaller graphs such that a property  ... 
doi:10.1007/3-540-61474-5_81 fatcat:eadzi53prrhebpoo6o3sokemua

On a modal lambda calculus for S4

1995 Theoretical Computer Science  
We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings.  ...  of these models.  ...  Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional  ... 
doi:10.1016/0304-3975(96)80140-x fatcat:34yi3zt6lndvnb7vsbrnk2wuoa

Objects, interference and the Yoneda embedding

1995 Theoretical Computer Science  
We first describe a new type system inspired in part by linear logic and verify that reductions preserve typings.  ...  of these models.  ...  Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional  ... 
doi:10.1016/0304-3975(96)80139-3 fatcat:bqcssjjpjzhnvgj27ohd26ukku

LTL Generalized Model Checking Revisited [chapter]

Patrice Godefroid, Nir Piterman
2008 Lecture Notes in Computer Science  
In this paper, we revisit generalized model checking for linear time (LTL) properties.  ...  Given a 3-valued abstraction of a program (possibly generated using static program analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks whether there  ...  We thank Michael Huth for comments on an earlier version and Orna Kupferman for a discussion of the relative expressive power of NBT and NCT.  ... 
doi:10.1007/978-3-540-93900-9_11 fatcat:4omj3mchcnc6ha2mmms7dokrwa

LTL generalized model checking revisited

Patrice Godefroid, Nir Piterman
2010 International Journal on Software Tools for Technology Transfer (STTT)  
In this paper, we revisit generalized model checking for linear time (LTL) properties.  ...  Given a 3-valued abstraction of a program (possibly generated using static program analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks whether there  ...  We thank Michael Huth for comments on an earlier version and Orna Kupferman for a discussion of the relative expressive power of NBT and NCT.  ... 
doi:10.1007/s10009-010-0169-3 fatcat:zgiuc23tsrb4niiobauge5hrzm

Page 6638 of Mathematical Reviews Vol. , Issue 90K [page]

1990 Mathematical Reviews  
Lambek, Fixpoints revisited (pp. 200-207); Yiannis N. Moschovakis, A mathematical model- ing of pure, recursive algorithms (pp. 208-229); V. Yu.  ...  Maibaum, The prescription and description of state based systems (pp. 243-294); Ruurd Kuiper, Enforcing nondeterminism via linear time tem- poral logic specifications using hiding (pp. 295-303); Chao Chen  ... 

The Smyth completion: a common foundation for denotational semantics and complexity analysis

1995 Theoretical Computer Science  
Applications include a new formulation of natural deduction for intuitionistic linear logic, modal logical frameworks, and a logical analysis of staged computation and binding-time analysis for functional  ...  of these models.  ... 
doi:10.1016/0304-3975(96)80141-1 fatcat:2rpt7dgkkncqjic42lsk5jteqi

Page 8148 of Mathematical Reviews Vol. , Issue 2004j [page]

2004 Mathematical Reviews  
Slissenko], A logic of probability with decidable model-checking (306-321).  ...  Rybina] and Andrei Voronkov, Fast infinite-state model checking in integer- based systems (546-573); Igor Walukiewicz, Winning strategies and synthesis of controllers (574); Yu Zhang and David Nowak, Logical  ... 

Cumulative subject index

1978 Information and Control  
39, 143 Probability logic fuzzy logic and, 38, 154 Process decision, sequential: nondeterministic models, 37, 40 Programming fuzzy mathematical, theorems derived, 38, 241 Programs with minimal  ...  fuzzy logic and, 38, 154 Unequal error protection optimal encodings of linear block codes for, 37, 150 Unification problem, third order dyadic: un- decidability of, 38, 170 Universal grammars  ... 
doi:10.1016/s0019-9958(78)90707-6 fatcat:3g6qa5hi2zc2lgyyvndbar65di

Page 10270 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
(CZ-MASC; Brno) ; Strejéek, Jan (CZ-MASC; Brno) The stuttering principle revisited: on the expressiveness of nested X and U operators in the logic LTL.  ...  Labelled transition systems model processes by explicitly describ- ing their states and their transitions from state to state, together with the actions that produced them.  ... 

Page 6499 of Mathematical Reviews Vol. , Issue 98J [page]

1998 Mathematical Reviews  
Using a graph-theoretic representation of logic programs and their stable models, we discuss and compare linear programming, propositional satisfiability, constraint satis- faction, and graph methods.”  ...  the scope of imperative state effects in ALGOL-like languages.  ... 

Page 7574 of Mathematical Reviews Vol. , Issue 2000k [page]

2000 Mathematical Reviews  
Recursively regular ordinals (465—499); Alasdair Urquhart, The complexity of linear logic with weakening (500-515); Philip D. Welch, Some remarks on the maximality of inner models (516-540).  ...  Ilijas Farah, Liftings of homomorphisms between quotient struc- tures and Ulam stability (173-196); Petr Hajek [Petr Hajek'], Mathematical fuzzy logicstate of art (197-205); Kai Hauser, Reflections on  ... 
« Previous Showing results 1 — 15 out of 50,226 results