21. A Temporal Logic Language For Context Awareness In Pointcuts | Lambda The Ultima For this purpose we give an overview of HALO, a novel pointcut language based on logic meta programming and temporal logic, which allows one to reason about http://lambda-the-ultimate.org/node/2185

@import "misc/drupal.css"; @import "themes/chameleon/ltu/style.css"; Lambda the Ultimate Home Feedback FAQ ... Archives User login Username: Password: Create new account Request new password Navigation recent posts Home A Temporal Logic Language for Context Awareness in Pointcuts A paper by Charlotte Herzeel, Kris Gybels, Pascal Costanza presented at Some program concerns cannot be cleanly modularized, and their implementation leads to code that is both hard to understand and maintain. In this paper we consider extending an e-commerce application, written in CLOS, with two of such crosscutting concerns. Though most of the time Common Lisp's macro facilities and CLOS method combinations can be used to modularize crosscuts, we discuss the use of a more declarative solution when crosscuts depend on the execution history. For this purpose we give an overview of HALO, a novel pointcut language based on logic meta programming and temporal logic, which allows one to reason about program execution and (past) program state. Charlotte Herzeel presented this at ILC with a flashy web-shop application built on Edi Weitz's standard tools of the web trade. The example takes the basic web-shop and uses aspects to add a lot of funky rules about promotion and discounts based on stock levels, what's selling well, what the user has been browsing, etc, and makes sure the discounts are honoured at the checkout.

22. Temporal Logic In Specification 1987 @proceedings{DBLPconf/tls/1987, editor = {Behnam Banieqbal and Howard Barringer and Amir Pnueli}, title = {temporal logic in Specification, Altrincham, UK, http://www.informatik.uni-trier.de/~ley/db/conf/tls/tls1987.html

Temporal Logic in Specification 1987: Altrincham, UK Behnam Banieqbal Howard Barringer Amir Pnueli (Eds.): Temporal Logic in Specification, Altrincham, UK, April 8-10, 1987, Proceedings. Lecture Notes in Computer Science 398 Springer 1989, ISBN 3-540-51803-7 BibTeX DBLP Logic Colin Stirling : Comparing Linear and Branching Time Temporal Logics. 1-20 BibTeX Shmuel Katz Doron Peled : Interleaving Set Temporal Logic. 21-43 BibTeX Susanne Graf Joseph Sifakis : An Expressive Logic for a Process Algebra with Silent Actions. 44-61 BibTeX Behnam Banieqbal Howard Barringer : Temporal Logic with Fixed Points. 62-74 BibTeX Automata, Theorem Proving and Model Checking Pierre Wolper : On the Relation of Programs and Computations to Models of Temporal Logic. 75-123 BibTeX Zohar Manna Amir Pnueli : Specification and Verification of Concurrent Programs by forall-Automata. 124-164 BibTeX Bernhard Josko : MCTL - An Extension of CTL for Modular Verification of Concurrent Systems. 165-187 BibTeX Edmund M. Clarke Orna Grumberg : The Model Checking Problem for Concurrent Systems with Many Similar Processes. 188-201 BibTeX Moshe Y. Vardi

23. Temporal Logic With Past Is Exponentially More Succinct Abstract The old question whether temporal logic with pasttime modalities is exponentially more succinct than pure-future temporal logic has recently been http://www.lsv.ens-cachan.fr/~markey/PLTL.php

Temporal Logic with Past is Exponentially More Succinct Abstract : The old question whether temporal logic with past-time modalities is exponentially more succinct than pure-future temporal logic has recently been answered positively What is temporal logic with past? It is temporal logic where future-time modalities, such as F sometimes in the future G always in the future U until "), ... are complemented with their past-time counterparts ( P or F for " once in the past H or G for " always in the past S or U for " since Is it useful? Yes. Indeed, specifications expressed in natural language often use references to events that occured in the past. One finds it natural to express that "every request is eventually granted" by G (request => F grant) Thus we woud like to express that "every grant is preceeded by a request" by the formula G (grant => F request) Is it really useful? It is possible to express the property of formula (2) without past-time modalities, and write U Formula (3) only uses future modalities, and is equivalent to formula (2) when interpreted at the beginning of a path. This is a general pattern. Gabbay

24. Category:Topic Temporal Logic - Ontoworld.org temporal logic is a part of the Semantic Web Topic Hierarchy. It was introduced in version 1.1 as described in History of the Semantic Web Topic Hierarchy. http://ontoworld.org/wiki/Category:Topic_temporal_logic

Category:Topic temporal logic From Ontoworld.org Jump to: navigation search edit Short Definition This topic is about Temporal Logic, a sub-topic of Logics. temporal logic is a part of the Semantic Web Topic Hierarchy . It was introduced in version 1.1 as described in History of the Semantic Web Topic Hierarchy edit More External Information about temporal logic Search for Semantic Web publications using FacetedDBLP (the search is restricted to the main venues publishing about 'Semantic Web'). Search for computer science publications using FacetedDBLP Search for computer science experts using ASPL-2 Search for computer science publishing venues using ASPL-2 Search for Semantic Web tools and applications for temporal logic Search for scientific publications as phrase or bag of keywords on Google Scholar Search as phrase or bag of keywords on Google Look into Wikipedia Search for Semantic Web educational resources on REASE Search the Ontology Outreach Advisory It is part of the Semantic Web Topic Hierarchy Articles in category "Topic temporal logic" There is one article in this category.

25. Temporal Logic Thayse 1989 and Thayse 1991 also consider, in informative detail, how to go about proving things in lineartime temporal logic (and in enhancements of it). http://www.rpi.edu/~brings/LOG AI/lai/node8.html

26. Tauriainen: Automata And Linear Temporal Logic: Translations With Transition-Bas This thesis develops the theory of translating propositional linear time temporal logic (LTL) into nondeterministic automata via selfloop alternating http://lib.tkk.fi/Diss/2006/isbn9512283433/

Kirjasto Library Electronic dissertations Haku ... Instructions Automata and Linear Temporal Logic: Translations with Transition-Based Acceptance Heikki Tauriainen Dissertation for the degree of Doctor of Science in Technology to be presented with due permission of the Department of Computer Science and Engineering for public examination and debate in Auditorium T2 at Helsinki University of Technology (Espoo, Finland) on the 27 th of October, 2006, at 12 o'clock noon. Dissertation in PDF format (ISBN 951-22-8343-3) [2583 KB] Errata (in PDF format) Dissertation is also available in print (ISBN 951-22-8342-5) Abstract Automata theory provides powerful tools for designing and implementing decision procedures for temporal logics and their applications to the automatic verification of systems against their logical specifications. Implementing these decision procedures by making use of automata built from the systems and their specifications with translation procedures is challenging in practice due to the tendency of the automata to grow easily unmanageably large as the size of the systems or the logical specifications increases. Keywords: linear time temporal logic, alternating automata, nondeterministic automata, transition-based acceptance, minimization, nondeterminization, emptiness checking, nested depth-first search

27. TCS - Research - Publications - On Translating Linear Temporal Logic Into Altern linear temporal logic, alternating automata, automata minimization, title = {On Translating Linear temporal logic into Alternating and Nondeterministic http://www.tcs.hut.fi/Publications/info/bibdb.HUT-TCS-A83.shtml

TCS Research Publications / On Translating Linear Temporal Logic into Alternating and Nondeterministic Automata On Translating Linear Temporal Logic into Alternating and Nondeterministic Automata Reference: Heikki Tauriainen On translating linear temporal logic into alternating and nondeterministic automata . Research Report A83, Helsinki University of Technology Laboratory for Theoretical Computer Science , Espoo, Finland, December 2003. Abstract: Automata theory provides valuable tools for designing and implementing decision procedures for temporal logics and their applications to automatic verification of systems against their logical specifications. Implementing these decision procedures by analyzing automata built from the systems and their specifications with translation procedures is nevertheless very challenging in practice due to the tendency of the automata to grow easily unmanageably large as the size of the systems or (especially) the logical specifications increases. Keywords: linear temporal logic, alternating automata, automata minimization, nested depth-first search

28. Modal Temporal Logic Research into temporal logic includes the study of temporal logic within the framework of logic and covers axiom systems, theorem proving and proof theory, http://www.comp.brad.ac.uk/research/ai/temporal.html

Department of Computing University of Bradford University Information Service: Contents Index Search Modal Temporal Logic Research into temporal logic includes the study of temporal logic within the framework of logic and covers: axiom systems, theorem proving and proof theory, model theory, execution models and applications. Author: I.S.Torsun Last update: 2/5/96 Up to AI group homepage

29. LNCS 4202 - Temporal Logic Verification Using Simulation Your browser may not have a PDF reader available. Google recommends visiting our text version of this document. http://www.springerlink.com/index/m7x48421183x6x80.pdf

30. Propositional Linear Temporal Logic And Language Homomorphisms This paper we will develop a mapping R from formulae of the Propositional Linear temporal logic abbr. PLTL to PLTL formulae in such a way that if L is a http://citeseer.ist.psu.edu/387250.html

31. Applied Logic :: Temporal Logic --  Britannica Online Encyclopedia Britannica online encyclopedia article on applied logic, temporal logic The object of temporal logicvariously called chronological logic or tense logicis http://www.britannica.com/eb/article-65908/applied-logic

var britAdCategory = "other"; Already a member? LOGIN Encyclopædia Britannica - the Online Encyclopedia Home Blog Advocacy Board ... Free Trial Britannica Online Content Related to this Topic This Article's Table of Contents Expand all Collapse all Introduction The critique of forms of reasoning Correct and defective argument forms Kinds of fallacies Material fallacies Verbal fallacies Formal fallacies Epistemic logic ... Print this Table of Contents Linked Articles tense time-related Shopping New! Britannica Book of the Year The Ultimate Review of 2007. 2007 Britannica Encyclopedia Set (32-Volume Set) Revised, updated, and still unrivaled. New! Britannica 2008 Ultimate DVD/CD-ROM The world's premier software reference source. applied logic Temporal logic Page 20 of 29 Temporal logic tense time-related is was applied logic... (75 of 13548 words) To read the full article, activate your FREE Trial Close Enable free complete viewings of Britannica premium articles when linked from your website or blog-post. Now readers of your website, blog-post, or any other web content can enjoy full access to this article on applied logic , or any Britannica premium article for free, even those readers without a premium membership. Just copy the HTML code fragment provided below to create the link and then paste it within your web content. For more details about this feature, visit our

32. Model Checking For A First-Order Temporal Logic Using Multiway Your browser may not have a PDF reader available. Google recommends visiting our text version of this document. http://comjnl.oxfordjournals.org/cgi/reprint/47/1/71.pdf

33. Temporal Logic In Artificial Intelligence Topics to be covered include theory of temporal logic, first order temporal logics, interval temporal logics, ontologies of time, reasoning about action http://www.cs.brandeis.edu/~cs112/cs112-2004/

Home Class Headline News Staff Course Description ... Lab for Linguistics and Computation COSI 112: Temporal Logic in Artificial Intelligence Brandeis University Fall 2004 Time: Tue., Fri. 10:40-12:00 pm Location: Volen 106 Class Headline News Check it regularly! LAST ANNOUNCEMENT: 12/9/04 Staff Professor: James Pustejovsky 258 Volen Center, jamesp@cs.brandeis.edu Office hours: TBA TA: Jessica Littman 110 Volen Center, jlittman@cs.brandeis.edu Office hours: Mon. 10:00-11:30 am Thurs. 1:30-3:00 pm TA: 110 Volen Center, roser@cs.brandeis.edu Office hours: Tue. 1:00-2:30 pm Wed. 10:00-11:30 am Course Description In this course, we will cover the role that time plays in artificial intelligence and reasoning systems. Topics to be covered include: theory of temporal logic, first order temporal logics, interval temporal logics, ontologies of time, reasoning about action and change, dynamic logic, time in problem solving (diagnosis, scheduling), tense and aspect in language, semantics of tense, temporal reasoning in language, annotating time and event expressions, temporal data models, temporal query languages, temporal database systems. Handouts Propositional Equivalences Natural Deduction Tips Propositional Logic Resolution Modal Logic in CS ... Time and Time Again, James Allen

34. Timing In Music And Modal Temporal Logic - Journal Of Mathematics And Music: Mat Intime representations of music in which the time represented is the same time as inhabited by the agent making or using the representa http://www.informaworld.com/smpp/content~content=a788153656~db=all~jumptype=rss

Skip over navigation HOME ABOUT US CONTACT US ... LIBRARIANS Search in entire site Publication Names ISSN/ISBNs Subject Names Author Names Title/Kwds/Abstract or Explore informaworld Journals eBooks Reference Works Allied Health Anthropology Area Studies Arts Behavioral Sciences Bioscience Built Environment Chemistry Communication Studies Computer Science Cultural Studies Dentistry Development Studies Earth Sciences Education Arena Ergonomics Food Science Geography History Law Literature, Language and Linguistics Medicine Pharmaceutical Science Philosophy Physics Religion Social Work Toxicology Urban Studies Browse Publications A-Z Browse ... Got a Voucher? Username: Password: athens sso forgotten password? hide informaworld HOME SEARCH BROWSE Issues List ... Related articles first prev toc next last Download Citation Recommend Mark Alert Link Print hide Please choose the type of alert you would like: Citation Alert New citations of this Article will trigger an alert New Issue Alert New issues of Journal of Mathematics and Music will trigger an alert iFirst Alert New iFirst articles in Journal of Mathematics and Music will trigger an alert Note: To be alerted to new content in all related publications, please click on one of the subject areas below and select

35. IOS Press Books Online, Untitled Page From temporal logic Queries to Vacuity Detection, 149, , 167 We focus on temporal logic queries with unique strongest solutions, describe fragments of http://www.booksonline.iospress.nl/Content/View.aspx?piid=3092

36. (D. Drusinsky, M. Shing) Monitoring Temporal Logic Specifications Combined With Using such temporal logic with time Series (TLS), it is possible to monitor important properties such as stability, monotonicity, temporal average and sum http://www.jucs.org/jucs_9_11/monitoring_temporal_logic_specification

top.name="UJSeries_Window"; Search Subscription Submission Procedure Login User: anonymous Special Issues Volume 13 (2007) Volume 12 (2006) Volume 11 (2005) ... Issue 11 available in: HTML (36 kB) PDF (155 kB) PS (163 kB) get: Similar Docs BibTeX Read comments Write a comment get: Links into Future Monitoring Temporal Logic Specifications Combined with Time Series Constraints Doron Drusinsky (Naval Postgraduate School and Time-Rover, Inc., USA) Man-Tak Shing (Naval Postgraduate School California, USA) Abstract: Keywords: Execution-based Model Checking, Rapid Prototyping, Real-time Systems, Run-time Execution Monitoring, Temporal Logic Categories: D.2.1 D.2.4 D.2.5 D.2.6 ... F.3.1

37. Logicomp Linear Temporal Logic (1) Anthony Widjaja To S Blog On As their name suggests, temporal logics are logics where truth values of formulas may change over time. The significance of temporal logic in computer http://logicomp.blogspot.com/2006/06/linear-temporal-logic-1.html

@import url("http://www.blogger.com/css/blog_controls.css"); @import url("http://www.blogger.com/dyn-css/authorization.css?targetBlogID=12932458"); var BL_backlinkURL = "http://www.blogger.com/dyn-js/backlink_count.js";var BL_blogId = "12932458"; Logicomp Logic and Complexity Wednesday, June 14, 2006 Linear Temporal Logic (1) As their name suggests, temporal logics are logics where truth values of formulas may change over time. The significance of temporal logic in computer science is indisputable, especially in verification of safety-critical reactive systems. Model checkers of many flavors of temporal logics have been developed to the extent that they can quickly verify real-world systems with a huge number of states. Furthermore, in contrast to many other tools and techniques of formal methods which are semi-automatic and relatively expensive, model checking is fully-automatic and quite cheap (excellent free model checkers like SPIN exist). Last year these tools and techniques were awarded the ACM Paris Kanellakis Theory and Practice Award. Amir Pnueli, the researcher who introduced the idea of using temporal logic in verification, was awarded the ACM Turing Award in 1996. As we mentioned, temporal logic comes in a number of flavors. At present we deal only with

38. Characterizing Kripke Structures In Temporal Logic. The question of whether branchingtime temporal logic or linear-time temporal logic is best for reasoning about concurrent programs is one of the most http://stinet.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA

39. LINA - Jean-Claude Royer - 2001 - Temporal Logic Verifications For UML: The Vend Our purpose in this paper is to show that writing and proving temporal logic properties become effective in this context. Because we have Statechart i.e. a http://lina.atlanstic.net/fr/productions/RR/rr_1_29.html

site web LINA Accueil Le laboratoire Annuaire Projet scientifique (PDF) ... TALN Services Rapports de recherche Publications Logiciels Rechercher ... english Rapport de recherche 2001 Jean-Claude Royer "Temporal Logic Verifications for UML: the Vending Machine example" To verify UML specifications we need a formal specification, that is a well-known difficulty. Since UML allows data types and dynamic specifications the verification of temporal, even logic, properties leads to other problems. This paper presents an example of a system specified in UML and completed with a formal and component-oriented approach. We use an algebraic approach called Graphic Abstract data Types (GAT) based on Statechart and algebraic specifications of partial abstract data types. Our purpose in this paper is to show that writing and proving temporal logic properties become effective in this context. Because we have Statechart: i.e. a symbolic system with guards, variables and data values, classical model checking is not sufficient enough. We rather advo-cate proofs with a general theorem prover and the use of functional operators expressing temporal properties. We show several examples of properties and proofs using first-order predicate logic. IRIN (RR.01.10)

40. Search Results For "temporal Logic" – FacetedDBLP 33, Naoshi Uchihira, Shinichi Honiden Compositional adjustment of concurrent programs to satisfy temporal logic constraints in MENDELS ZONE. http://dblp.l3s.de/?q=temporal logic&resultsPerPage=100

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 2     21-40 of 66    Back | 1  | 2  | 3  | 4  | Next 20