Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2012-11-01 10:25
A SAT Encoding for Finding Operation Sequences of Malbolge that Implement Trit-wise Functions
Satoshi Ando, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, Naoki Nishida (Nagoya Univ.) SS2012-37
Abstract (in Japanese) (See Japanese page) 
(in English) Malbolge is known to be one of the most esoteric programming languages. Although it becomes possible to write programs in Malbolge language due to the development of the low-level assembly language, the programming in the low-level assembly language is difficult. This is because the arithmetic instructions of the low-level assembly language are not those of ordinary programming languages, but the same as the ones of Malbolge. To construct a program in low-level assembly language, it is necessary to find instruction sequences of Malbolge that implement binary trit-wise functions. For finding such instruction sequences, however, an inefficient exhaustive search is the only known method, which is one of limitations in developing programs in the low-level assembly language. In this paper, to solve this problem, we propose a method to find instruction sequences of Malbolge that implement binary trit-wise functions, which is more efficient due to the use of state-of-art SAT solvers. We formalize a problem that finds an instruction sequence of Malbolge that implements a given binary trit-wise function,and propose a SAT encoding for this problem. Experiments shows that our method is able to find instruction sequences faster than the existing method and hence essentially longer ones.
Keyword (in Japanese) (See Japanese page) 
(in English) Esoteric programming language / Malbolge / SAT encoding / Trit-wise function / / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 275, SS2012-37, pp. 7-12, Nov. 2012.
Paper # SS2012-37 
Date of Issue 2012-10-25 (SS) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF SS2012-37

Conference Information
Committee SS IPSJ-SE  
Conference Date 2012-11-01 - 2012-11-02 
Place (in Japanese) (See Japanese page) 
Place (in English) Hiroshima City University 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Software science, theory 
Paper Information
Registration To SS 
Conference Code 2012-11-SS-SE 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A SAT Encoding for Finding Operation Sequences of Malbolge that Implement Trit-wise Functions 
Sub Title (in English)  
Keyword(1) Esoteric programming language  
Keyword(2) Malbolge  
Keyword(3) SAT encoding  
Keyword(4) Trit-wise function  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Satoshi Ando  
1st Author's Affiliation Graduate School of Information Science, Nagoya University (Nagoya Univ.)
2nd Author's Name Masahiko Sakai  
2nd Author's Affiliation Graduate School of Information Science, Nagoya University (Nagoya Univ.)
3rd Author's Name Toshiki Sakabe  
3rd Author's Affiliation Graduate School of Information Science, Nagoya University (Nagoya Univ.)
4th Author's Name Keiichirou Kusakari  
4th Author's Affiliation Graduate School of Information Science, Nagoya University (Nagoya Univ.)
5th Author's Name Naoki Nishida  
5th Author's Affiliation Graduate School of Information Science, Nagoya University (Nagoya Univ.)
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2012-11-01 10:25:00 
Presentation Time 25 minutes 
Registration for SS 
Paper # SS2012-37 
Volume (vol) vol.112 
Number (no) no.275 
Page pp.7-12 
#Pages 6 
Date of Issue 2012-10-25 (SS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan