Relevant bibliographies by topics / Compilation Rules

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Compilation Rules'

Author: Grafiati
Published: 4 June 2021
Last updated: 8 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Compilation Rules.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Compilation Rules"

1

Cools, Ronald, and Philip Rabinowitz. "Monomial cubature rules since “Stroud”: a compilation." Journal of Computational and Applied Mathematics 48, no. 3 (November 1993): 309–26. http://dx.doi.org/10.1016/0377-0427(93)90027-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

YIN, Ming-Hao, Ji-Gui SUN, Hai LIN, and Xia WU. "Possibilistic Extension Rules for Reasoning and Knowledge Compilation." Journal of Software 21, no. 11 (January 28, 2011): 2826–37. http://dx.doi.org/10.3724/sp.j.1001.2010.03690.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

HOLZBAUR, CHRISTIAN, MARIA GARCIA DE LA BANDA, PETER J. STUCKEY, and GREGORY J. DUCK. "Optimizing compilation of constraint handling rules in HAL." Theory and Practice of Logic Programming 5, no. 4-5 (July 2005): 503–31. http://dx.doi.org/10.1017/s1471068405002413.

Full text
Abstract:
In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we show how we can use different kinds of information in the compilation of CHRs to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. The kinds of information used include the types, modes, determinism, functional dependencies and symmetries of the CHR constraints. We also show how to analyze CHR programs to determine this information about functional dependencies, symmetries and other kinds of information supporting optimizations.
APA, Harvard, Vancouver, ISO, and other styles
4

Rocha, André Dantas, Valter Vieira De Camargo, and Paulo César Masiero. "Uso de Aspectos para Verificar Regras de Instanciação de Frameworks." Revista de Informática Teórica e Aplicada 11, no. 2 (December 20, 2004): 9–20. http://dx.doi.org/10.22456/2175-2745.5979.

Full text
Abstract:
Instantiation of frameworks is usually a time-consuming, error-prone process as there are specific rule types that must be followed to produce an application that meets its requirements. Some of these rules refer to framework specific implementation policies and cannot be verified in compilation time, such as nomenclature rules and default constructors. A relevant problem is that faults generated when these rules are not applied can only be detected later, during the system usage. A mechanism to enforce that certain rules for a persistency framework be strictly followed, is shown. Keyword: AOP, frameworks, instantiation rules
APA, Harvard, Vancouver, ISO, and other styles
5

Cools, Ronald. "Monomial cubature rules since “Stroud”: a compilation — part 2." Journal of Computational and Applied Mathematics 112, no. 1-2 (November 1999): 21–27. http://dx.doi.org/10.1016/s0377-0427(99)00229-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kordela, Marzena. "Teoria prawa Zygmunta Ziembińskiego." Filozofia Publiczna i Edukacja Demokratyczna 4, no. 1 (July 15, 2018): 230–49. http://dx.doi.org/10.14746/fped.2015.4.1.12.

Full text
Abstract:
Zygmunt Ziembiński was one of the most prominent theoreticians of law in Poland in the second half of the 20th century. He developed an original theory of law defined as a theory of legal phenomena, which covered both logical-linguistic as well as real aspects of law. The theory served as a base for the development of a unique so-called advanced normative conception of sources of law, one of the greatest achievements of theory of law in Poland. This conception encompasses all the indispensable elements of a coherent system of binding legal norms: 1) indication of a political justification (ideological assumptions) of the entire system of law; 2) pre judgment of law-making competence of government agencies; 3) determination of the status of custom and precedent; 4) compilation of a catalogue of permissible interpretation rules; 5) compilation of a catalogue of permissible inferential rules (permissible rules of legal inferences); 6) compilation of a catalogue of permissible collision rules.
APA, Harvard, Vancouver, ISO, and other styles
7

Cook, Kristin L., Sarah B. Bush, and Karen Karp. "Clarifying Confusing Science Rules, Vocabulary & Diagrams." American Biology Teacher 78, no. 8 (October 1, 2016): 676–78. http://dx.doi.org/10.1525/abt.2016.78.8.676.

Full text
Abstract:
While a wealth of research exists examining elementary teachers' and students' alternative conceptions about science and offering recommendations for teacher preparation to include an emphasis on supporting conceptual change, this article presents a useful compilation that serves as a go-to resource on some of the most common oversimplified rules, incomplete or misleading vocabulary, and confusing diagrams promulgated in science teaching that could lead to enduring student misconceptions.
APA, Harvard, Vancouver, ISO, and other styles
8

Pradana, Rizky Dwi. "KRITIK TERHADAP KOMPILASI HUKUM ISLAM MENGENAI STATUS AHLI WARIS KHUNTSA." Pamulang Law Review 1, no. 1 (July 15, 2019): 31. http://dx.doi.org/10.32493/palrev.v1i1.2844.

Full text
Abstract:
Abstract The study in this scientific work is actually aimed at the existence of a 26-year-old Compilation of Islamic Law (KHI) against the inheritance of khuntsa where there are no clear rules regarding the inheritance of khuntsa. Even though we can find the inheritance discussion in classical fiqh books, there are various opinions to the differences of opinion of the jurists or priests regarding the sex status of khuntsa to the acquisition of inheritance that should have been received by the khuntsa. The question is isn't the classical fiqh books used as a reference in the KHI compilation process? This research shows that there is no rule in KHI regarding inheritance of khuntsa, this makes it possible for later the birth of legal certainty because of the various decisions in the Religious Court on the same case but not in classical fiqh books discussing khuntsa based on the hadith of the Prophet Muhammad. Keywords: Critics, Compilation of Islamic Law (KHI), khuntsa
APA, Harvard, Vancouver, ISO, and other styles
9

Umam, Khairul. "Penyerapan Fiqh Madzhab Syafi’i dalam Penyusunan Kompilasi Hukum Islam." Journal de Jure 9, no. 2 (December 30, 2017): 117. http://dx.doi.org/10.18860/j-fsh.v9i2.6991.

Full text
Abstract:
<p>Islamic Law Compilation is still an interesting topic to study by Muslim scholars in Indonesia. The Islamic Law Compilation is a typical Indonesian jurisprudence used as reference for religious court judges. This article aims to identify the use of the Shafi'ite school on the rules of marriage in the Islamic Law Compilation. This article comes from normative research with a descriptive approach. The results of this study show that the influence of the Shafi'i school is more dominant in the Islamic Law Compilation. However, the compilers of the Islamic Law Compilations used the opinion of other schools. The articles relating to the requirements, pillars and procedures for implementing marriage are absorbed from the provisions of the Shafi'ite jurisprudence. Such as marital proposal, marriage guardian, ijab qabul, and dowry. the Islamic Law Compilation is not only collecting or adopting the classical jurisprudence of Islamic scholars, but it also provides a new provision that has not yet existed in the treasures of the previous Islamic jurisprudence.</p>Kompilasi Hukum Islam masih menjadi bahan menarik untuk dikaji oleh sarjana muslim di Indonesia. Kompilasi Hukum Islam merupakan fiqh khas Indonesia yang dijadikan rujukan bagi hakim pengadilan agama. Artikel ini bertujuan mengidentifikasi penggunaan mazhab Syafi’i pada aturan perkawinan dalam Kompilasi Hukum Islam. Artikel ini berasal dari penelitian normatif dengan pendekatan deskriptif. Hasil penelitian ini menujukkan bahwa Pengaruh mazhab Syafi’i lebih dominan dalam penyusunan Kompilasi Hukum Islam. Meskipun demikian, para perumus Kompilasi Hukum Islam menggunakan pendapat mazhab lain. Pasal-pasal yang berkaitan dengan syarat, rukun dan tata cara pelaksanaan perkawinan diserap dari ketentuan fiqh mazhab Syafi’i. Seperti peminangan, wali nikah, ijab qabul, mahar. Kompilasi Hukum Islam bukan hanya sekedar mengumpulkan atau mengadopsi pandagan ulama fiqh klasik. Akan tetapi memberikan ketentuan baru yang belum ada dalam khazanah fiqh terdahulu.
APA, Harvard, Vancouver, ISO, and other styles
10

Keller, Agathe. "The mathematical chapter of the Āryabhaṭīya : A compilation of oral mnemonic rules ?" Archives Internationales d'Histoire des Sciences 65, no. 175 (July 2015): 573–98. http://dx.doi.org/10.1484/j.arihs.5.112778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Compilation Rules"

1

Astiasuinzarra, Bereciartua Txomin. "COMPILATION OF TASK ANALYSIS METHODS: PRACTICAL APPROACH OF HIERARCHICAL TASK ANALYSIS, COGNITIVE WORK ANALYSYS AND GOALS, OPERATIONS, METHODS AND SELECTION RULES." Thesis, KTH, Industriell ekonomi och organisation (Inst.), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-91369.

Full text
Abstract:
Progressively Human Factor methods are becoming more and more relevant in companies. Companies are more conscious about how affect work environment in workers and those in productivity. Globalization also affect to the companies given that they have to be more competitive, effective and flexible. In this context, Human Factors carry out very important role. With this perspective, this thesis is oriented to get acquainted some of the different methods of Human Factors. Human Factor's area is very extensive, for this reason in the thesis are included some of the most important methods. The main objective is to achieve a general perspective, a practical perspective. According with the previous paragraph, in this thesis the most relevant variables and constraints are analyzed and compared. It is theoretical based; different papers, articles and books are the platform of the thesis. The most prestigious authors’ works are included. Hierarchical Task Analysis (HTA), Cognitive Work Analysis (CWA) and Goal, Operator, Method, and Selection (GOMS) are the chosen methods. There are comparisons between HTA and CWA, and a general comparison between different techniques of GOMS. At the end, there are conclusions in order to underpin the previous analyses and comparisons.
APA, Harvard, Vancouver, ISO, and other styles
2

Teitelbaum, Aryeh Roberto, and a_hay@jct ac il. "Arts'Codes: A New Methodology for the Development of Real-Time Embedded Applications for Control Systems." RMIT University. Accounting and Law, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20071219.094115.

Full text
Abstract:
Embedded real-time applications have to allow interaction between the control computer and the controlled environment. Controlling the environment requires in particular to take into account its time constraints and critical logical conditions. One of the main programmer efforts in real-time application's development is to trace the incoming events, and to perform reactions based on the current system status, according to the application requirements. All this have to be handled, although external events may come in the middle of a critical reaction, which may disturb it. This problem involves two difficulties: „X The cognitive efforts to percept the problem, and consequently to express the solution. „X The correct translation of this solution to code. Two requirements were defined in this research in order to achieve high-quality performance: clearness and robustness, clearness in the design, and robustness in the execution. In this work the author proposes a methodology and a tool for real-time application's development that uses or implies an innovated form of design based on natural-cognitive researches. This design method has clear compilation's rules to produce an Object-Oriented light-code, suitable for embedded platforms. These compilation's rules introduce to the code implicit security and synchronization's elements, to support robust execution. In this methodology, clear development phases were defined, using a high-degree of reuse and even polymorphism, which were emphasized in the research. Several existing ideas were improved/adapted and synthesized together with the author's innovation, creating the Arts'Codes method for real-time application development. The work includes cognitive evaluations, assuring the natural skills of the design. Arts'Codes method proposes a natural VPL (Visual Programming Language) for real-time applications, based on hierarchic components. This VPL is built on a minimum of diagrams: one for the static architecture and one for the dynamic behaviour, with a similar restricted notation at all levels. These two diagrams (static architecture and dynamic behaviour) are interleaved in a unified view. This method was implemented by building a suitable graphic editor, which automatically compiles the applications diagrams in a light and robust Object-Oriented code (based on Parallel Automata FSM), and by building an execution compact software platform. Furthermore, the parallel automata FSM are translated automatically in PTL temporal formula defining the goals and the behaviours of the components, permitting to prove a-priory that the components behaviours are consistent to their goals. The execution platform is based on a restricted implementation of the synchrony hypothesis and on a powerful model of execution: the parallel automata FSM. These Parallel Automata describe the dynamic behaviours of the components and allows implementing run-time exceptions handling too. In addition, the research proposes a tri-processor execution hardware platform, which supports a hybrid synchronous/multi-threading execution. This method will contribute to versatile, clear and robust real-time application's development.
APA, Harvard, Vancouver, ISO, and other styles
3

Cañabate, Estrella Pulido. "Recursive query processing in deductive databases using graph traversal and rule compilation techniques." Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319084.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Royer, Véronique. "Compilation dirigee par la semantique : une methode constructive." Toulouse 3, 1986. http://www.theses.fr/1986TOU30170.

Full text
Abstract:
Dans le cadre de la generation de compilateurs dirigee par la semantique, se pose le probleme de transformer une semantique source d'un langage de programmation en une semantique objet equivalente, plus proche d'une implementation. La plupart des travaux dans ce domaine resolvent ce probleme de facon non constructive: une semantique objet est d'abord exhibee, ensuite prouvee correcte vis-a-vis de la semantique source. Le but de cette these est de montrer qu'on peut deriver une semantique objet a partir d'une semantique source d'un langage, de maniere constructive, tout en preservant certains criteres de correction fixes au depart
APA, Harvard, Vancouver, ISO, and other styles
5

Osório, Fernando Santos. "Inss : un système hybride neuro-symbolique pour l'apprentissage automatique constructif." Grenoble INPG, 1998. https://tel.archives-ouvertes.fr/tel-00004899.

Full text
Abstract:
Plusieurs méthodes ont été développées par l'Intelligence Artificielle pour reproduire certains aspects de l'intelligence humaine. Ces méthodes permettent de simuler les processus de raisonnement en s'appuyant sur les connaissances de base disponibles. Chaque méthode comporte des points forts, mais aussi des limitations. La réalisation de systèmes hybrides est une démarche courante Qui permet de combiner les points forts de chaque approche, et d'obtenir ainsi des performances plus élevées ou un champ d'application plus large. Un autre aspect très important du développement des systèmes hybrides intelligents est leur capacité d'acquérir de nouvelles connaissances à partir de plusieurs sources différentes et de les faire évoluer. Dans cette thèse, nous avons développé des recherches sur les systèmes hybrides neuro-symboliques, et en particulier sur l'acquisition incrémentale de connaissances à partir de connaissances théoriques (règles) et empiriques (exemples). Un nouveau système hybride, nommé système INSS - Incremental Neuro-Symbolic System, a été étudié et réalisé. Ce système permet le transfert de connaissances déclaratives (règles symboliques) d'un module symbolique vers un module connexionniste (réseau de neurones artificiel - RNA) à travers un convertisseur de règles en réseau. Les connaissances du réseau ainsi obtenu sont affinées par un processus d'apprentissage à partir d'exemples. Ce raffinement se fait soit par ajout de nouvelles connaissances, soit par correction des incohérences, grâce à l'utilisation d'un réseau constructif de type Cascade-Correlation. Une méthode d'extraction incrémentale de règles a été intégrée au système INSS, ainsi que des algorithmes de validation des connaissances qui ont permis de mieux coupler les modules connexionniste et symbolique. Le système d'apprentissage automatique INSS a été conçu pour l'acquisition constructive (incrémentale) de connaissances. Le système a été testé sur plusieurs applications, en utilisant des problèmes académiques et des problèmes réels (diagnostic médical, modélisation cognitive et contrôle d'un robot autonome). Les résultats montrent que le système INSS a des performances supérieures et de nombreux avantages par rapport aux autres systèmes hybrides du même type
Various Artificial Intelligence methods have been developed to reproduce intelligent human behaviour. These methods allow to reproduce some human reasoning process using the available knowledge. Each method has its advantages, but also some drawbacks. Hybrid systems combine different approaches in order to take advantage of their respective strengths. These hybrid intelligent systems also present the ability to acquire new knowledge from different sources and so to improve their application performance. This thesis presents our research in the field of hybrid neuro-symbolic systems, and in particular the study of machine learning tools used for constructive knowledge acquisition. We are interested in the automatic acquisition of theoretical knowledge (rules) and empirical knowledge (examples). We present a new hybrid system we implemented: INSS - Incremental Neuro-Symbolic System. This system allows knowledge transfer from the symbolic module to the connectionist module (Artificial Neural Network - ANN), through symbolic rule compilation into an ANN. We can refine the initial ANN knowledge through neural learning using a set of examples. The incremental ANN learning method used, the Cascade-Correlation algorithm, allows us to change or to add new knowledge to the network. Then, the system can also extract modified (or new) symbolic rules from the ANN and validate them. INSS is a hybrid machine learning system that implements a constructive knowledge acquisition method. We conclude by showing the results we obtained with this system in different application domains: ANN artificial problems(The Monk's Problems), computer aided medical diagnosis (Toxic Comas), a cognitive modelling task (The Balance Scale Problem) and autonomous robot control. The results we obtained show the improved performance of INSS and its advantages over others hybrid neuro-symbolic systems
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Compilation Rules"

1

State), Goa (India :. Kantak's compilation of Goa acts & rules. [S.l: s.n.], 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

(India), Orissa. Compilation of the Orissa general financial rules. Cuttack: Legal Miscellany, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

(India), Madhya Pradesh. A compilation of Madhya Pradesh fundamental rules: As amended uptodate. Bhopal: Suvidha Law House, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

India. Manual of criminal laws with important rules: A compilation of bare acts and rules as amended up to date. Delhi: Delhi Law House, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

New York (N.Y.). Law Department. The official compilation of the rules of the City of New York: With annotations. 2nd ed. Albany, New York: New York Legal Publishing Corporation, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Montana. Montana library laws: A compilation of sections of Montana code annotated, administrative rules of Montana, etc. [Helena]: The Library, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

US GOVERNMENT. Compilation of laws and rules pertaining to the Joint Economic Committee, Congress of the United States. Washington: U.S. G.P.O., 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

US GOVERNMENT. Compilation of laws and rules relating to the congressional budget process: As amended through March 23, 2000. Washington: U.S. G.P.O., 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Compilation of laws and rules relating to the congressional budget process: As amended through November 30, 2008. Washington: U.S. G.P.O., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

California. Compendium 2006: A compilation of rules and codes that govern the conduct of California official court reporters. Sacramento, CA: California Court Reporters Association, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Compilation Rules"

1

Holzbaur, Christian, María García de la Banda, David Jeffery, and Peter J. Stuckey. "Optimizing Compilation of Constraint Handling Rules." In Logic Programming, 74–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45635-x_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lee, Sang Ho, and Lawrence J. Henschen. "Substitution-based compilation of extended rules in deductive databases." In 10th International Conference on Automated Deduction, 57–71. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/3-540-52885-7_79.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Sneyers, Jon. "Optimizing Compilation and Computational Complexity of Constraint Handling Rules." In Logic Programming, 494–98. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02846-5_41.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hanus, Michael. "CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry." In Practical Aspects of Declarative Languages, 74–89. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19686-2_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Graña, Jorge, Gloria Andrade, and Jesús Vilares. "Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers." In Implementation and Application of Automata, 128–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/3-540-44977-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Albert, Elvira, Reiner Hähnle, Alicia Merayo, and Dominic Steinhöfel. "Certified Abstract Cost Analysis." In Fundamental Approaches to Software Engineering, 24–45. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71500-7_2.

Full text
Abstract:
AbstractA program containing placeholders for unspecified statements or expressions is called an abstract (or schematic) program. Placeholder symbols occur naturally in program transformation rules, as used in refactoring, compilation, optimization, or parallelization. We present a generalization of automated cost analysis that can handle abstract programs and, hence, can analyze the impact on the cost of program transformations. This kind of relational property requires provably precise cost bounds which are not always produced by cost analysis. Therefore, we certify by deductive verification that the inferred abstract cost bounds are correct and sufficiently precise. It is the first approach solving this problem. Both, abstract cost analysis and certification, are based on quantitative abstract execution (QAE) which in turn is a variation of abstract execution, a recently developed symbolic execution technique for abstract programs. To realize QAE the new concept of a cost invariant is introduced. QAE is implemented and runs fully automatically on a benchmark set consisting of representative optimization rules.
APA, Harvard, Vancouver, ISO, and other styles
7

Cervesato, Iliano, Edmund Soon Lee Lam, and Ali Elgazar. "Choreographic Compilation of Decentralized Comprehension Patterns." In Rule Technologies. Research, Tools, and Applications, 113–29. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-42019-6_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

De Koninck, Leslie, Peter J. Stuckey, and Gregory J. Duck. "Optimizing Compilation of CHR with Rule Priorities." In Functional and Logic Programming, 32–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78969-7_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Paviotti, Marco, Simon Cooksey, Anouk Paradis, Daniel Wright, Scott Owens, and Mark Batty. "Modular Relaxed Dependencies in Weak Memory Concurrency." In Programming Languages and Systems, 599–625. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_22.

Full text
Abstract:
AbstractWe present a denotational semantics for weak memory concurrency that avoids thin-air reads, provides data-race free programs with sequentially consistent semantics (DRF-SC), and supports a compositional refinement relation for validating optimisations. Our semantics identifies false program dependencies that might be removed by compiler optimisation, and leaves in place just the dependencies necessary to rule out thin-air reads. We show that our dependency calculation can be used to rule out thin-air reads in any axiomatic concurrency model, in particular C++. We present a tool that automatically evaluates litmus tests, show that we can augment C++ to fix the thin-air problem, and we prove that our augmentation is compatible with the previously used compilation mappings over key processor architectures. We argue that our dependency calculation offers a practical route to fixing the longstanding problem of thin-air reads in the C++ specification.
APA, Harvard, Vancouver, ISO, and other styles
10

Beringer, Lennart. "Verified Software Units." In Programming Languages and Systems, 118–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_5.

Full text
Abstract:
AbstractModularity - the partitioning of software into units of functionality that interact with each other via interfaces - has been the mainstay of software development for half a century. In case of the C language, the main mechanism for modularity is the compilation unit / header file abstraction. This paper complements programmatic modularity for C with modularity idioms for specification and verification in the context of Verifiable C, an expressive separation logic for CompCert . Technical innovations include (i) abstract predicate declarations – existential packages that combine Parkinson & Bierman’s abstract predicates with their client-visible reasoning principles; (ii) residual predicates, which help enforcing data abstraction in callback-rich code; and (iii) an application to pure (Smalltalk-style) objects that connects code verification to model-level reasoning about features such as subtyping, self, inheritance, and late binding. We introduce our techniques using concrete example modules that have all been verified using the Coq proof assistant and combine to fully linked verified programs using a novel, abstraction-respecting component composition rule for Verifiable C.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Compilation Rules"

1

Goldschmidt, Art, and Dipayan Gangopadhyay. "Adding Prolog Rules and OOPs Inheritance to Legacy Databases." In ASME 1991 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1991. http://dx.doi.org/10.1115/edm1991-0186.

Full text
Abstract:
Abstract We present a viable approach to add rules capability or object orientation to legacy databases. Using a combination of language compilation, run-time trigger mechanisms and inter-language call facility, we integrate an object-oriented logic programming language, called OOLP, with an existing CIM Database System Product, IBM’s CIM CDF. The result is a system that provides storage management of complex objects, rule-based validation, object oriented knowledge modelling and declarative query capability.
APA, Harvard, Vancouver, ISO, and other styles
2

Chevaleyre, Yann, Jérôme Lang, Nicolas Maudet, and Jérôme Monnot. "Compilation and communication protocols for voting rules with a dynamic set of candidates." In hte 13th Conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2000378.2000396.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

chen, Ya, Guang Xi, and Hoekyung Jung. "Research on Automatic Acquisition and Compilation of Office Software Secondary Development Based on Association Rules." In 2020 International Conference on Information Science and Education (ICISE-IE). IEEE, 2020. http://dx.doi.org/10.1109/icise51755.2020.00078.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ramaswamy, Sanjay, Jami J. Shah, and Joseph K. Davidson. "Computer Aided GD&T Advisor Based on Y14.5 Conformance and Good Practice." In ASME 2001 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2001. http://dx.doi.org/10.1115/detc2001/dfm-21172.

Full text
Abstract:
Abstract Contemporary CAD systems support GD&T specifications simply as textual attributes which does not facilitate validation of dimensioning and tolerancing. The Y14.5 tolerance standard is quite complex and many engineers are not quite familiar with all this intricacies. A few expert systems have been developed for GD&T support but they typically focus on tolerance values and their cost consequences. This paper presents the design and implementation of an integrated system for specification and automatic validation of dimensioning and tolerancing schemes in conformance with Y14.5. The validation includes not only tolerance values but choice of datums and datum reference frames. Additionally, the GD&T specifications are checked against good practice rules. This paper also provides a compilation of such rules from a variety of sources.
APA, Harvard, Vancouver, ISO, and other styles
5

Lagniez, Jean-Marie, and Pierre Marquis. "An Improved Decision-DNNF Compiler." In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/93.

Full text
Abstract:
We present and evaluate a new compiler, called d4, targeting the Decision-DNNF language. As the state-of-the-art compilers C2D and Dsharp targeting the same language, d4 is a top-down tree-search algorithm exploring the space of propositional interpretations. d4 is based on the same ingredients as those considered in C2D and Dsharp (mainly, disjoint component analysis, conflict analysis and non-chronological backtracking, component caching). d4 takes advantage of a dynamic decomposition approach based on hypergraph partitioning, used sparingly. Some simplification rules are also used to minimize the time spent in the partitioning steps and to promote the quality of the decompositions. Experiments show that the compilation times and the sizes of the Decision-DNNF representations computed by d4 are in many cases significantly lower than the ones obtained by C2D and Dsharp.
APA, Harvard, Vancouver, ISO, and other styles
6

Métais, Thomas, Stéphan Courtin, Manuela Triay, François Billon, Pascal Duranton, Rudy Briot, Florent Bridier, Cédric Gourdin, and Jean-Pascal Luciani. "An Assessment of the Safety Factors and Uncertainties in the Fatigue Rules of the RCC-M Code Through the Benchmark With the EN-13445-3 Standard." In ASME 2017 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/pvp2017-65397.

Full text
Abstract:
The RCC-M code [1] is a well recognized international code and provides rules for the design and the construction of mechanical equipment for pressurized water reactors. It is used today for the nuclear industry exclusively, in countries such as France, South Africa and China and it is the basis for the design of the UK EPR to be built in Hinkley Point. The RCC-M code’s fatigue rules emanate from the ASME Boiler and Pressure Vessel Code and are hence very similar, albeit they have evolved in their own way over time to include some R&D results and other evolutions. These rules are published by AFCEN which involves a wide range of international organizations from the nuclear industry such as Apave, Areva, Bureau Veritas, CEA, DCNS, EDF, EDF Energy, ONET-MHI, Rolls-Royce and Westinghouse. The EN-13445-3 [2] is a European standard which is mostly in use today in the conventional industry. Its fatigue rules are a compilation of rules from various national European codes, such as the German AD-Merkblatt, the British Standards, the Eurocodes for civil works and the French CODAP. The rules for fatigue are compiled in Chapters 17 and 18 of EN-13445-3 and have been the result of the work of contributors from major European organizations from the nuclear, oil and gas, chemical and mechanical industries: these include, among others, Areva, the Linde Group, CETIM, TÜV, and the TWI (The Welding Institute). Since the beginning of 2015, AFCEN has created a technical Working Group (WG) on the topic of fatigue with the objective of identifying the Safety Factors and Uncertainties in Fatigue analyses (SFUF) and of potentially proposing improvements in the existing fatigue rules of the code. Nevertheless, the explicit quantification of safety factors and uncertainties in fatigue is an extremely difficult task to perform for fatigue analyses without a comparison to the operating experience or in relation to another code or standard. Historically, the approach of the code in fatigue has indeed been to add conservatism at each step of the analyses which has resulted in a difficult quantification of the overall safety margin in the analyses. To fulfill its mission, the working group has deemed necessary to lead a benchmark with the EN-13445-3 standard given its wide use through other industries. Two cases were identified: either the comparison with EN-13445-3 is possible and in this case, the identification of safety factors and uncertainties is performed in relation to this standard; either the comparison is not possible, in which case the overall conservatism of the RCC-M code is evaluated in relation with operating experience, test results, literature, etc... This paper aims at describing the overall work of the group and focuses more specifically on the results obtained through the benchmark with the EN-13445-3 standard.
APA, Harvard, Vancouver, ISO, and other styles
7

Blaiech, Khalil, Salaheddine Hamadi, Stefan Hommes, Petko Valtchev, Omar Cherkaoui, and Radu State. "Rule Compilation in Multi-Tenant Networks." In 2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS). IEEE, 2017. http://dx.doi.org/10.1109/ancs.2017.34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Holland, Alexander, Madjid Fathi, and Stefan Berlik. "Rule-Based Compilation of Graphical Structures." In 2006 IEEE International Conference on Systems, Man and Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icsmc.2006.385154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Trabia, Mohamed B., and Mohammad Y. Saadeh. "A Hybrid Master-Slave Genetic Algorithm-Neural Network Approach for Modeling a Piezoelectric Actuator." In ASME 2012 Conference on Smart Materials, Adaptive Structures and Intelligent Systems. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/smasis2012-7925.

Full text
Abstract:
This work presents an approach for developing the model of a smart fin dynamics that is activated by a fully-enclosed piezoelectric (PZT) bimorph actuator, which is created by bonding two Macro Fiber Composites (MFCs). Observing the dynamics of the fin indicates that the use of a linear dynamic model does not adequately describe its behavior. An earlier work proposed incorporating a proportional damping matrix as well as Bouc-Wen hysteresis model and backlash operators to create a more accurate model. However, the number of parameters describing the expanded model is large, which limits its use. Therefore, there is a need for a different approach for developing an alternative model of the fin. In this work, a hybrid master-slave Genetic Algorithm (GA)-Neural Network (NN) model is proposed to identify the optimal set of parameters for the damping matrix constants, the Bouc-Wen hysteresis model and the backlash operators. A total of nine sinusoidal input voltage cases that resemble a grid of three different amplitudes excited at three different frequencies are used to train and validate the model. Three input cases are considered for training the NN architecture, connection weights, bias weights and learning rules using GA. The NN consists of three layers: an input layer that has two nodes for the amplitude and the frequency of the input voltage, an output layer that has seven nodes for the backlash, hysteresis, and damping operators, and a hidden layer that is free to have any number of nodes between two and nine. The GA constantly performs natural selection of chromosomes that propagate best compilation of NN parameters. Simulation results show that the proposed model can predict the damping, hysteresis and backlash of the smart fin–actuator system under various operational conditions.
APA, Harvard, Vancouver, ISO, and other styles
10

Holland, Alexander, and Madjid Fathi. "A Framework for the Rule-Based Compilation of Decision Networks." In 2006 IEEE International Conference on Computational Cybernetics. IEEE, 2006. http://dx.doi.org/10.1109/icccyb.2006.305703.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Compilation Rules' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography