Invited Speakers.- A Rewriting Logic Sampler.- Codes and Length-Increasing Transitive Binary Relations.- Languages and Process Calculi for Network Aware Programming - Short Summary -.- Stochastic Analysis of Graph Transformation Systems: A Case Study in P2P Networks.- Component-Based Software Engineering.- Formal Languages.- Outfix-Free Regular Languages and Prime Outfix-Free Decomposition.- Solving First Order Formulae of Pseudo-Regular Theory.- Splicing Array Grammar Systems.- Computer Science Logics.- Compositionality of Fixpoint Logic with Chop.- An SLD-Resolution Calculus for Basic Serial Multimodal Logics.- Upside-Down Transformation in SOL/Connection Tableaux and Its Application.- Program Construction.- On the Stability Semantics of Combinational Programs.- Generating C Code from LOGS Specifications.- Formalizing the Debugging Process in Haskell.- Finding Resource Bounds in the Presence of Explicit Deallocation.- Real-Time Systems.- The Timer Cascade: Functional Modelling and Real Time Calculi.- A Robust Interpretation of Duration Calculus.- Symbolic Model Checking of Finite Precision Timed Automata.- Concurrency and Refinement.- Covarieties of Coalgebras: Comonads and Coequations.- Linking Theories of Concurrency.- On Cool Congruence Formats for Weak Bisimulations.- Externalized and Internalized Notions of Behavioral Refinement.- Software Security.- Information Flow Is Linear Refinement of Constancy.- On Typing Information Flow.- Representation and Reasoning on RBAC: A Description Logic Approach.- Revisiting Failure Detection and Consensus in Omission Failure Environments.- Quantitative Logics.- Congruences and Bisimulations for Continuous-Time Stochastic Logic.- A Logic for Quantum Circuits and Protocols.- Quantitative Temporal Logic Mechanized in HOL.- Weak Stochastic Bisimulation for Non-markovian Processes.- Object-Orientation and Component Systems.- On Refinement of Software Architectures.- POST: A Case Study for an Incremental Development in rCOS.- Implementing Application-Specific Object-Oriented Theories in HOL.- Constructing Open Systems via Consistent Components.- Model-Checking and Algorithms.- A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems.- Using Fairness Constraints in Process-Algebraic Verification.- Maximum Marking Problems with Accumulative Weight Functions.- Applied Logics and Computing Theory.- Toward an Abstract Computer Virology.- On Superposition-Based Satisfiability Procedures and Their Combination.- Tutorials at ICTAC 2005.- A Summary of the Tutorials at ICTAC 2005.

Theoretical aspects of computing : ICTAC 2005 : second International colloquium, Hanoi, Vietnam, October 17-21, 2005 : proceedings

We present a summary, Sect. 2, of a structure of domain analysis and description concepts: techniques and tools. And we link, in Sect. 3, these concepts, embodied in domain analysis prompts and domain description prompts, in a model of how a diligent domain analyser cum describer would use them. We claim that both sections, Sects. 2–3, contribute to a methodology of software engineering. S. Iida, J. Meseguer, and K. Ogata (Eds.): Futatsugi Festschrift, LNCS 8373, pp. 1–34, 2014. c © Springer-Verlag Berlin Heidelberg 2014

Specification, Algebra, and Software

Trace slicing is a widely used technique for execution trace analysis that is effectively used in program debugging, analysis and comprehension. In this paper, we present a backward trace slicing technique that can be used for the analysis of Rewriting Logic theories. Our trace slicing technique allows us to systematically trace back rewrite sequences modulo equational axioms (such as associativity and commutativity) by means of an algorithm that dynamically simplifies the traces by detecting control and data dependencies, and dropping useless data that do not influence the final result. Our methodology is particularly suitable for analyzing complex, textually-large system computations such as those delivered as counter-example traces by Maude model-checkers.

/pdf/backward-trace-slicing-for-rewriting-logic-theories-4z3hjtk7t5.pdf

Backward trace slicing for rewriting logic theories

Using conditional trace slicing for improving Maude programs

Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we present a fold/unfold-based transformation framework for rewriting logic theories which is based on narrowing. For the best of our knowledge, this is the first fold/unfold transformation framework which allows one to deal with functions, rules, equations, sorts, and algebraic laws (such as commutativity and associativity). We provide correctness results for the transformation system w.r.t. the semantics of ground reducts. Moreover, we show how our transformation technique can be naturally applied to implement a Code Carrying Theory (CCT) system. CCT is an approach for securing delivery of code from a producer to a consumer where only a certificate (usually in the form of assertions and proofs) is transmitted from the producer to the consumer who can check its validity and then extract executable code from it. Within our framework, the certificate consists of a sequence of transformation steps which can be applied to a given consumer specification in order to automatically synthesize safe code in agreement with the original requirements. We also provide an implementation of the program transformation framework in the high-performance, rewriting logic language Maude which, by means of an experimental evaluation of the system, highlights the potentiality of our approach.

A fold/unfold transformation framework for rewrite theories extended to CCT

This paper presents an extension of Pathway Logic, called Quantitative Pathway Logic (QPL), which allows one to reason about quantitative aspects of biological processes, such as element concentrations and reactions kinetics. Besides, it supports the modeling of inhibitors, that is, chemicals which may block a given reaction whenever their concentration exceeds a certain threshold. QPL models can be specified and directly simulated using rewriting logic or can be translated into Discrete Functional Petri Nets (DFPN) which are a subclass of Hybrid Functional Petri Nets in which only discrete transitions are allowed. Under some constraints over the anonymous variables appearing in the QPL models, the transformation between the two computational models is shown to preserve computations. By using the DFPN representation our models can be graphically visualized and simulated by means of well known tools (e.g. Cell Illustrator); moreover standard Petri net analyses (e.g. topological analysis, forward/backward reachability, etc .) may be performed on the net model. An executable framework for QPL and for the translation of QPL models into DFPNs has been implemented using the rewriting-based language Maude. We have tested this system on several examples.

Quantitative Pathway Logic for Computational Biology

https://users.dimi.uniud.it/~demis.ballis/philrep.pdf

Phil: A Lazy Implementation of a Language for Approximate Filtering of XML Documents

In this paper, we present a rule-based specification language to define and automatically check semantic as well as syntactic constraints over the informative content of a Web system. The language is inspired by the GVERDI language and significantly extends it by integrating ontology reasoning into the specification rules and by adding new syntactic constructs. The resulting language increases the expressiveness of the original one and enables a more sophisticated treatment of the semantic information related to the contents of the Web system.

Semantic Verification of Web System Contents

This paper presents a rule-based, domain specific language for modeling access control policies which is particularly suitable for managing security in the semantic web, since (i) it allows one to evaluate authorization requests according to semantic information retrieved from remote knowledge bases; (ii) it supports semantic-based policy composition, delegation and closure via flexible operators which can be defined by security administrators in a pure declarative way with little effort. The operational engine of the language smoothly integrates description logic into standard term rewriting giving support to reasoning capabilities which are particularly useful in this context, since they allow one to naturally combine and reuse data extracted from multiple knowledge bases. Such a rewrite engine can be used to evaluate authorization requests w.r.t. a policy specification as well as to formally check properties regarding the security domain to be protected. The language we propose has been implemented in a prototypical system, which is written in Haskell. Some case studies have been analyzed to highlight the potentiality of our approach.

An access control language based on term rewriting and description logic

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Michele Baggi

Author Tools

Chat about Author