Sciweavers

1818 search results - page 226 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
FUIN
2000
71views more  FUIN 2000»
15 years 3 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
ENTCS
2002
128views more  ENTCS 2002»
15 years 3 months ago
Rewriting Calculus with(out) Types
The last few years have seen the development of a new calculus which can be considered as an outcome of the last decade of various researches on (higher order) term rewriting syst...
Horatiu Cirstea, Claude Kirchner, Luigi Liquori
ENTCS
2007
126views more  ENTCS 2007»
15 years 3 months ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...
134
Voted
IGPL
2002
91views more  IGPL 2002»
15 years 3 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
TPDS
1998
124views more  TPDS 1998»
15 years 3 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
Lars Lundberg, Håkan Lennerstad